Master

Author: gitgou

.vscode/c_cpp_properties.json

@@ -0,0 +1,19 @@
+{
+    "configurations": [
+        {
+            "name": "Mac",
+            "includePath": [
+                "${workspaceFolder}/**"
+            ],
+            "defines": [],
+            "macFrameworkPath": [
+                "/Library/Developer/CommandLineTools/SDKs/MacOSX.sdk/System/Library/Frameworks"
+            ],
+            "compilerPath": "/usr/bin/clang",
+            "cStandard": "c17",
+            "cppStandard": "c++17",
+            "intelliSenseMode": "macos-clang-arm64"
+        }
+    ],
+    "version": 4
+}

.vscode/launch.json

@@ -0,0 +1,18 @@
+{
+  "configurations": [
+    {
+      "name": "C/C++: g++ 生成和调试活动文件",
+      "type": "cppdbg",
+      "request": "launch",
+      "program": "${fileDirname}/${fileBasenameNoExtension}",
+      "args": [],
+      "stopAtEntry": false,
+      "cwd": "${fileDirname}",
+      "environment": [],
+      "externalConsole": false,
+      "MIMode": "lldb",
+      "preLaunchTask": "C/C++: g++ 生成活动文件"
+    }
+  ],
+  "version": "2.0.0"
+}

.vscode/tasks.json

@@ -0,0 +1,29 @@
+{
+  "tasks": [
+    {
+      "type": "cppbuild",
+      "label": "C/C++: g++ 生成活动文件",
+      "command": "/usr/bin/g++",
+      "args": [
+        "-fdiagnostics-color=always",
+        "-std=c++11",
+        "-g",
+        "${file}",
+        "-o",
+        "${fileDirname}/${fileBasenameNoExtension}"
+      ],
+      "options": {
+        "cwd": "${fileDirname}"
+      },
+      "problemMatcher": [
+        "$gcc"
+      ],
+      "group": {
+        "kind": "build",
+        "isDefault": true
+      },
+      "detail": "调试器生成的任务。"
+    }
+  ],
+  "version": "2.0.0"
+}

NumMatrix.cpp

@@ -0,0 +1,39 @@
+#include<iostream>
+#include<vector>
+using namespace std;
+
+class NumMatrix {
+public:
+    NumMatrix(vector<vector<int>>& matrix) {
+        int m = matrix.size(), n = matrix[0].size();
+        nums = vector<vector<int>> (m, vector<int>(n, 0));
+        for(int i = 0; i < m; ++i){
+            for(int j = 0; j < n; ++j){
+                if(i == 0 && j == 0){
+                    nums[i][j] = matrix[i][j];
+                }else if(i == 0){
+                    nums[i][j] = nums[i][j - 1] + matrix[i][j];
+                }else if(j == 0){
+                    nums[i][j] = nums[i - 1][j] + matrix[i][j];
+                }else{
+                    nums[i][j] = nums[i - 1][j] + nums[i][j - 1] - nums[i - 1][j - 1] + matrix[i][j]; 
+                }
+            }
+        }
+    }
+    
+    int sumRegion(int row1, int col1, int row2, int col2) {
+        //cout << "row2 " << row2 << " col2 " << col2 << " row1 " << row1 << " col1 " << col1 << endl; 
+        if(col1 == 0 && row1 == 0)
+            return nums[row2][col2];
+        else if(col1 == 0)
+            return nums[row2][col2] - nums[row1 - 1][col2];
+        else if(row1 == 0)
+            return nums[row2][col2] - nums[row2][col1 - 1];
+        else 
+            return nums[row2][col2] - nums[row1 - 1][col2] - nums[row2][col1 - 1] + nums[row1 - 1][col1 - 1];
+    }
+
+private:
+    vector<vector<int>> nums;
+};

a.out

@@ -0,0 +1,39 @@
+#include<vector>
+#include<iostream>
+#include<string>
+using namespace std;
+
+struct TreeNode {
+    int val;
+    TreeNode *left;
+    TreeNode *right;
+    TreeNode() : val(0), left(nullptr), right(nullptr) {}
+    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+};
+
+class Solution {
+public:
+    void dfs(TreeNode* root, vector<string>& res, string str){
+        str.append(to_string(root->val));
+        if(!root->left && !root->right){
+            res.emplace_back(str);
+            return;
+        }else{
+            str += "->";
+        }
+        if(root->left)
+            dfs(root->left, res, str);
+        if(root->right)
+            dfs(root->right, res, str);
+
+    }
+
+    vector<string> binaryTreePaths(TreeNode* root) {
+        vector<string> res;
+        if(!root)
+            return res;
+        dfs(root, res, string());
+        return res;
+    }
+};

binaryTreePaths_257.cpp

@@ -0,0 +1,41 @@
+#include<iostream>
+#include<vector>
+
+using namespace std;
+
+class Solution {
+public:
+    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
+        int start = 0, n = gas.size();
+        while (start < n)
+        {
+            int gasSum = 0, costSum = 0;   
+            int index = 0; 
+            int cnt = 0;
+            while(cnt < n){
+                index = (start+cnt) % n;
+                gasSum += gas[index], costSum += cost[index];
+                if(gasSum < costSum){
+                  break;
+                }
+                cnt++;
+            }
+
+            if(index == start)
+                return start;
+            else{
+              start = index + cnt + 1;
+            }
+            cout << start << endl;
+        }
+        return -1; 
+    }
+};
+
+int main(){
+    vector<int> gas{1,2,3,4,5}, cost{3,4,5,1,2};
+    Solution solve;
+    int res = solve.canCompleteCircuit(gas, cost);
+    cout << res << endl;
+    return 0; 
+}

canCompleteCircuit

@@ -0,0 +1,20 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+	<dict>
+		<key>CFBundleDevelopmentRegion</key>
+		<string>English</string>
+		<key>CFBundleIdentifier</key>
+		<string>com.apple.xcode.dsym.canCompleteCircuit</string>
+		<key>CFBundleInfoDictionaryVersion</key>
+		<string>6.0</string>
+		<key>CFBundlePackageType</key>
+		<string>dSYM</string>
+		<key>CFBundleSignature</key>
+		<string>????</string>
+		<key>CFBundleShortVersionString</key>
+		<string>1.0</string>
+		<key>CFBundleVersion</key>
+		<string>1</string>
+	</dict>
+</plist>