update

Author: wuyinjun

1. 两数之和/main.py

@@ -0,0 +1,25 @@
+from typing import List
+
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        if len(nums) == 0:
+            return []
+        if len(nums) == 1:
+            if nums[0] == target:
+                return [0]
+            else:
+                return []
+        if len(nums) == 2:
+            if nums[0] + nums[1] == target:
+                return [0, 1]
+            else:
+                return []
+        for i in range(0, len(nums)):
+            for j in range(i + 1, len(nums)):
+                if nums[i] + nums[j] == target:
+                    return [i, j]
+        return []
+
+solution = Solution()
+result = solution.twoSum([3,2,4], 6)
+print(result)

1. 两数之和/main.rs

@@ -0,0 +1,28 @@
+struct Solution {
+
+}
+
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
+        let mut hash: HashMap<i32, i32> = HashMap::new();
+        let length = nums.len();
+
+        for i in 0..length {
+            let rest = nums[i];
+            if hash.contains_key(&rest) {
+                let index = hash[&rest];
+                return vec![index, i as i32];
+            } else {
+                hash.insert(target - rest, i as i32);
+            }
+        }
+        return vec![];
+    }
+}
+
+fn main() {
+    let result = Solution::two_sum(vec![3,3], 6);
+    println!("{:?}", result);
+}

105. 从前序与中序遍历序列构造二叉树/CMakeLists.txt

@@ -0,0 +1,7 @@
+cmake_minimum_required(VERSION 3.20)
+project(105__)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(105__
+        main.cpp)

105. 从前序与中序遍历序列构造二叉树/main.cpp

@@ -0,0 +1,19 @@
+#include <iostream>
+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:
+    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
+
+    }
+};

124. 二叉树中的最大路径和/CMakeLists.txt

@@ -0,0 +1,7 @@
+cmake_minimum_required(VERSION 3.13)
+
+project(cmake_testapp)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(cmake_testapp main.cpp)

124. 二叉树中的最大路径和/main.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+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:
+    int ans = INT_MIN;
+
+    int maxPathSum(TreeNode* root) {
+        return oneSideMax(root);
+    }
+
+    int oneSideMax(TreeNode* root) {
+        if (root == nullptr) return 0;
+    
+        int left = max(0, oneSideMax(root->left));
+        int right = max(0, oneSideMax(root->right));
+        
+        ans = max(ans, left + right + root->val);
+        return max(left, right) + root->val;
+    }
+};
+
+int main() {
+    return 0;
+}

21. 合并两个有序链表/MyPlayground.playground/playground.xcworkspace/contents.xcworkspacedata

@@ -0,0 +1,30 @@
+struct Solution {
+
+}
+
+impl Solution {
+    pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
+        if nums.len() < 2 {
+            return nums.len() as i32
+        }
+
+        let mut left: usize = 0;
+        let mut right: usize = 1;
+        while right < nums.len() {
+            if nums[left] == nums[right] {
+                right += 1;
+            } else {
+                nums[left + 1] = nums[right];
+                left += 1;
+                right += 1;
+            }
+        }
+        return left as i32 + 1;
+    }
+}
+
+fn main() {
+    let mut list = vec![1,1,2];
+    let result = Solution::remove_duplicates(&mut list);
+    println!("{:?}", result);
+}

21. 合并两个有序链表/MyPlayground.playground/playground.xcworkspace/xcuserdata/cedric.xcuserdatad/UserInterfaceState.xcuserstate

@@ -19,27 +19,27 @@ class Solution {
         return maxStr.count
     }
 
-    func lengthOfLongestSubstring(_ s: String) -> Int {
-        var left = 0
-        var right = 0
-        var length = 0
-
-        var set = Set<Character>()
-
-        while right < s.count {
-            let rightC = s[s.index(s.startIndex, offsetBy: right)]
-            if !set.contains(rightC) {
-                set.insert(rightC)
-                length = max(right - left + 1, length)
-                right += 1
-            } else {
-                let leftC = s[s.index(s.startIndex, offsetBy: left)]
-                set.remove(leftC)
-                left += 1
-            }
-        }
-        return length
-    }
+//    func lengthOfLongestSubstring(_ s: String) -> Int {
+//        var left = 0
+//        var right = 0
+//        var length = 0
+//
+//        var set = Set<Character>()
+//
+//        while right < s.count {
+//            let rightC = s[s.index(s.startIndex, offsetBy: right)]
+//            if !set.contains(rightC) {
+//                set.insert(rightC)
+//                length = max(right - left + 1, length)
+//                right += 1
+//            } else {
+//                let leftC = s[s.index(s.startIndex, offsetBy: left)]
+//                set.remove(leftC)
+//                left += 1
+//            }
+//        }
+//        return length
+//    }
 }
 
 let s = Solution()