Merge pull request algorithm004-05#1086 from AllenYN/master

400-Week 07

Week 7/id_400/LeetCode_190_400.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    int hammingWeight(uint32_t n) {
+        int ret = 0;
+        while (n != 0) {
+            n = n & (n - 1);
+            ret++;
+        }
+        return ret;
+    }
+};

Week 7/id_400/LeetCode_191_400.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    int hammingWeight(uint32_t n) {
+        int ret = 0;
+        while (n != 0) {
+            n = n & (n - 1);
+            ret++;
+        }
+        return ret;
+    }
+};

Week 7/id_400/LeetCode_56_400.cpp

@@ -0,0 +1,21 @@
+class Solution {
+public:
+    vector<vector<int>> merge(vector<vector<int>>& intervals) {
+        vector<vector<int>> ret;
+        if(intervals.size() == 0)
+            return ret;
+        sort(intervals.begin(), intervals.end());
+        for (int i = 0; i < intervals.size(); )
+        {
+            int left = intervals[i][0];
+            int right = intervals[i][1];
+            while (i < intervals.size() - 1 && right >= intervals[i+1][0]) {
+                i++;
+                right = max(right, intervals[i][1]);
+            }
+            ret.push_back({left, right});
+            i++;
+        }
+        return ret;
+    }
+};