add 1272

Author: luliyucoordinate

README.md

@@ -573,4 +573,5 @@ LeetCode
 |1267|[Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/)|c|[c++](./src/1267-Count-Servers-that-Communicate/1267.cpp)|[python](./src/1267-Count-Servers-that-Communicate/1267.py)|[go](./src/1267-Count-Servers-that-Communicate/1267.go)|[js](./src/1267-Count-Servers-that-Communicate/1267.js)|[java](./src/1267-Count-Servers-that-Communicate/1267.java)|Medium|
 |1268|[Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)|c|[c++](./src/1268-Search-Suggestions-System/1268.cpp)|[python](./src/1268-Search-Suggestions-System/1268.py)|[go](./src/1268-Search-Suggestions-System/1268.go)|[js](./src/1268-Search-Suggestions-System/1268.js)|[java](./src/1268-Search-Suggestions-System/1268.java)|Medium|
 |1269|[Number of Ways to Stay in the Same Place After Some Steps](https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/)|c|[c++](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.cpp)|[python](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.py)|[go](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.go)|[js](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.js)|[java](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.java)|Hard|
-|1271|[Hexspeak](https://leetcode.com/contest/biweekly-contest-14/problems/hexspeak/)|c|[c++](./src/1271-Hexspeak/1271.cpp)|[python](./src/1271-Hexspeak/1271.py)|[go](./src/1271-Hexspeak/1271.go)|[js](./src/1271-Hexspeak/1271.js)|[java](./src/1271-Hexspeak/1271.java)|Easy|
+|1271|[Hexspeak](https://leetcode.com/contest/biweekly-contest-14/problems/hexspeak/)|c|[c++](./src/1271-Hexspeak/1271.cpp)|[python](./src/1271-Hexspeak/1271.py)|[go](./src/1271-Hexspeak/1271.go)|[js](./src/1271-Hexspeak/1271.js)|[java](./src/1271-Hexspeak/1271.java)|Easy|
+|1272|[Remove Interval](https://leetcode.com/contest/biweekly-contest-14/problems/remove-interval/)|c|[c++](./src/1272-Remove-Interval/1272.cpp)|[python](./src/1272-Remove-Interval/1272.py)|[go](./src/1272-Remove-Interval/1272.go)|[js](./src/1272-Remove-Interval/1272.js)|[java](./src/1272-Remove-Interval/1272.java)|Medium|

src/1272-Remove-Interval/1272.cpp

@@ -0,0 +1,18 @@
+class Solution 
+{
+public:
+    vector<vector<int>> removeInterval(vector<vector<int>>& intervals, vector<int>& toBeRemoved) 
+    {
+        vector<vector<int>> res;
+        for (auto& inter : intervals)
+        {
+            if (inter[0] >= toBeRemoved[1] || inter[1] <= toBeRemoved[0]) res.push_back(inter);
+            else 
+            {
+                if (inter[0] < toBeRemoved[0]) res.push_back({inter[0], toBeRemoved[0]});
+                if (inter[1] > toBeRemoved[1]) res.push_back({toBeRemoved[1], inter[1]});
+            }
+        }
+        return res;
+    }
+};

src/1272-Remove-Interval/1272.go

@@ -0,0 +1,16 @@
+func removeInterval(intervals [][]int, toBeRemoved []int) [][]int {
+    res := make([][]int, 0)
+    for _, inter := range intervals {
+        if inter[0] >= toBeRemoved[1] || inter[1] <= toBeRemoved[0] {
+            res = append(res, inter)
+        } else {
+            if inter[0] < toBeRemoved[0] {
+                res = append(res, []int{inter[0], toBeRemoved[0]})
+            } 
+            if inter[1] > toBeRemoved[1] {
+                res = append(res, []int{toBeRemoved[1], inter[1]})
+            }
+        }
+    }
+    return res
+}

src/1272-Remove-Interval/1272.java

@@ -0,0 +1,14 @@
+class Solution {
+    public List<List<Integer>> removeInterval(int[][] intervals, int[] toBeRemoved) {
+        List<List<Integer>> res = new ArrayList();
+        for (int[] inter : intervals) {
+            if (inter[1] <= toBeRemoved[0] || inter[0] >= toBeRemoved[1]) {
+                res.add(Arrays.asList(inter[0], inter[1]));
+            } else {
+                if (inter[0] < toBeRemoved[0]) res.add(Arrays.asList(inter[0], toBeRemoved[0]));
+                if (inter[1] > toBeRemoved[1]) res.add(Arrays.asList(toBeRemoved[1], inter[1]));
+            }
+        }
+        return res;
+    }
+}

src/1272-Remove-Interval/1272.js

@@ -0,0 +1,11 @@
+var removeInterval = function(intervals, toBeRemoved) {
+    let res = [];
+    for (let inter of intervals) {
+        if (inter[0] >= toBeRemoved[1] || inter[1] <= toBeRemoved[0]) res.push(inter);
+        else {
+            if (inter[0] < toBeRemoved[0]) res.push([inter[0], toBeRemoved[0]]);
+            if (inter[1] > toBeRemoved[1]) res.push([toBeRemoved[1], inter[1]]);
+        }
+    }
+    return res;
+};

src/1272-Remove-Interval/1272.py

@@ -0,0 +1,12 @@
+class Solution:
+    def removeInterval(self, intervals: List[List[int]], toBeRemoved: List[int]) -> List[List[int]]:
+        res = []
+        for i, j in intervals:
+            if toBeRemoved[0] >= j or toBeRemoved[1] <= i:
+                res.append([i, j])
+            else:
+                if toBeRemoved[0] > i:
+                    res.append([i, toBeRemoved[0]])
+                if toBeRemoved[1] < j:
+                    res.append([toBeRemoved[1], j])
+        return res

src/addProb.py

@@ -2,10 +2,10 @@
 import os, bisect
 
 # 题目名称
-name = "Hexspeak"
-ID = 1271
-url = "https://leetcode.com/contest/biweekly-contest-14/problems/hexspeak/"
-difficult = "Easy"
+name = "Remove Interval"
+ID = 1272
+url = "https://leetcode.com/contest/biweekly-contest-14/problems/remove-interval/"
+difficult = "Medium"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']