6 problems solved.

lintcoder · lintcoder · commit b73b12d03dbb · 2020-02-22T10:22:28.000+08:00
diff --git a/src/1030.cpp b/src/1030.cpp
@@ -0,0 +1,35 @@
+vector<vector<int>> allCellsDistOrder(int R, int C, int r0, int c0) {
+        int total = R*C;
+        vector<vector<int>> res(total, vector<int>(2, 0));
+        struct Elem
+        {
+            int r;
+            int c;
+            int dist;
+            Elem(int _r = 0, int _c = 0):r(_r),c(_c){}
+        };
+        
+        vector<Elem> vec(total);
+        for (int i = 0; i < R; ++i)
+        {
+            for (int j = 0; j < C; ++j)
+            {
+                vec[i*C+j].r = i;
+                vec[i*C+j].c = j;
+                vec[i*C+j].dist = abs(i-r0) + abs(j-c0);
+            }
+        }
+        
+        auto cmp = [](const Elem& a, const Elem& b){
+            return a.dist < b.dist;
+        };
+        sort(vec.begin(), vec.end(), cmp);
+        
+        for (int i = 0; i < total; ++i)
+        {
+            res[i][0] = vec[i].r;
+            res[i][1] = vec[i].c;
+        }
+        
+        return res;
+    }
diff --git a/src/1217.cpp b/src/1217.cpp
@@ -0,0 +1,22 @@
+int minCostToMoveChips(vector<int>& chips) {
+        int len = chips.size();
+        if (len == 1)
+            return 0;
+        
+        int minval = 100;
+        for (int i = 0; i <len; ++i)
+        {
+            int t = 0;
+            for (int j = 0; j < len; ++j)
+            {
+                if (j != i)
+                {
+                    t += abs(chips[i]-chips[j])%2;
+                }
+            }
+            if (t < minval)
+                minval = t;
+        }
+        
+        return minval;
+    }
diff --git a/src/1351.cpp b/src/1351.cpp
@@ -0,0 +1,11 @@
+int countNegatives(vector<vector<int>>& grid) {
+        int row = grid.size();
+        int col = grid[0].size();
+        int ct = 0;
+        for (int i = 0; i < row; ++i)
+        {
+            ct += lower_bound(grid[i].rbegin(), grid[i].rend(), 0) - grid[i].rbegin();
+        }
+        
+        return ct;
+    }
diff --git a/src/589.cpp b/src/589.cpp
@@ -0,0 +1,21 @@
+vector<int> preorder(Node* root) {
+        if (root == nullptr)
+            return {};
+        vector<int> res;
+        search(root, res);
+        
+        return res;
+    }
+    
+    void search(Node* node, vector<int>& res)
+    {
+        res.push_back(node->val);
+        int len = (node->children).size();
+        if (len != 0)
+        {
+            for (int i = 0; i < len; ++i)
+            {
+                search((node->children)[i], res);
+            }    
+        }
+    }
diff --git a/src/590.cpp b/src/590.cpp
@@ -0,0 +1,22 @@
+vector<int> postorder(Node* root) {
+        if (root == nullptr)
+            return {};
+        
+        vector<int> res;
+        search(root, res);
+        
+        return res;
+    }
+    
+    void search(Node* node, vector<int>& res)
+    {
+        int len = (node->children).size();
+        if (len != 0)
+        {
+            for (int i = 0; i < len; ++i)
+            {
+                search((node->children)[i], res);
+            }
+        }
+        res.push_back(node->val);
+    }
diff --git a/src/976.cpp b/src/976.cpp
@@ -0,0 +1,15 @@
+int largestPerimeter(vector<int>& A) {
+        sort(A.begin(), A.end());
+        int len = A.size();
+        int maxPeri = 0;
+        for (int i = len-1; i >= 2; --i)
+        {
+            if (A[i-2] + A[i-1] >A[i])
+            {
+                maxPeri = A[i-2] + A[i-1] + A[i];
+                break;
+            }
+        }
+        
+        return maxPeri;
+    }
