Merge branch 'master' of https://github.com/doocs/leetcode.git

Author: Mrtj2016

solution/0055.Jump Game/Solution.java

@@ -0,0 +1,10 @@
+class Solution {
+    public boolean canJump(int[] nums) {
+        int count=0;
+        for(int i=nums.length-2;i>=0;i--) {
+            if (nums[i] > count) count = 0;
+            else count++;
+        }
+        return count==0;
+    }
+}

solution/0056.Merge Intervals/Solution.java

@@ -0,0 +1,29 @@
+/**
+ * Definition for an interval.
+ * public class Interval {
+ *     int start;
+ *     int end;
+ *     Interval() { start = 0; end = 0; }
+ *     Interval(int s, int e) { start = s; end = e; }
+ * }
+ */
+class Solution {
+    public List<Interval> merge(List<Interval> intervals) {
+        int n=intervals.size();
+        int[] starts=new int[n],ends=new int[n];
+        for(int i=0;i<n;i++){
+            starts[i]=intervals.get(i).start;
+            ends[i]=intervals.get(i).end;
+        }
+        Arrays.sort(starts);
+        Arrays.sort(ends);
+        List<Interval> res= new ArrayList<>();
+        for(int i=0,j=0;i<n;i++){
+            if((i == (n - 1)) || (starts[i + 1] > ends[i])){
+                res.add(new Interval(starts[j],ends[i]));
+                j=i+1;
+            }
+        }
+        return res;
+    }
+}

solution/0073.Set Matrix Zeroes/Solution.py

@@ -0,0 +1,17 @@
+class Solution:
+    def setZeroes(self, matrix):
+        """
+        :type matrix: List[List[int]]
+        :rtype: void Do not return anything, modify matrix in-place instead.
+        """
+
+        coord = []
+        for i in range(len(matrix)):
+            for j in range(len(matrix[i])):
+                if matrix[i][j] == 0:
+                    coord.append((i, j))
+        
+        for i, j in coord:
+            matrix[i] = [0]*len(matrix[i])
+            for x in range(len(matrix)):
+                matrix[x][j] = 0

solution/0074.Search a 2D Matrix/Solution.py

@@ -0,0 +1,27 @@
+class Solution:
+    def searchMatrix(self, matrix, target):
+        """
+        :type matrix: List[List[int]]
+        :type target: int
+        :rtype: bool
+        """
+
+        if not matrix or not matrix[0]:
+            return False
+
+        for row in matrix:
+            if row[0] <= target <= row[-1]:
+                s = 0
+                e = len(row)-1
+                while s <= e:
+                    mid = (s+e)//2
+                    if row[mid] == target:
+                        return True
+                    elif row[mid] > target:
+                        e = mid-1
+                    else:
+                        s = mid+1
+
+                return False
+
+        return False