supplement

OneCodeMonkey · OneCodeMonkey · commit 8d7c24d83251 · 2019-12-30T12:12:27.000+08:00
diff --git a/contest/leetcode_week_169_problems/[editing]leetcode_1304_Find_N_Unique_Integers_Sum_up_to_Zero.cpp b/contest/leetcode_week_169_problems/[editing]leetcode_1304_Find_N_Unique_Integers_Sum_up_to_Zero.cpp
@@ -0,0 +1,6 @@
+class Solution {
+public:
+    vector<int> sumZero(int n) {
+        
+    }
+};
diff --git a/contest/leetcode_week_169_problems/[editing]leetcode_1305_All_Elements_in_Two_Binary_Search_Trees.cpp b/contest/leetcode_week_169_problems/[editing]leetcode_1305_All_Elements_in_Two_Binary_Search_Trees.cpp
@@ -0,0 +1,15 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    vector<int> getAllElements(TreeNode* root1, TreeNode* root2) {
+        
+    }
+};
diff --git a/contest/leetcode_week_169_problems/[editing]leetcode_1306_Jump_Game_III.cpp b/contest/leetcode_week_169_problems/[editing]leetcode_1306_Jump_Game_III.cpp
@@ -0,0 +1,6 @@
+class Solution {
+public:
+    bool canReach(vector<int>& arr, int start) {
+        
+    }
+};
diff --git a/contest/leetcode_week_169_problems/[editing]leetcode_1307_Verbal_Arithmetic_Puzzle.cpp b/contest/leetcode_week_169_problems/[editing]leetcode_1307_Verbal_Arithmetic_Puzzle.cpp
@@ -0,0 +1,6 @@
+class Solution {
+public:
+    bool isSolvable(vector<string>& words, string result) {
+        
+    }
+};

-Original file line number
+Diff line change
@@ @@ -0,0 +1,6 @@ @@
 +class Solution {
 +public:
 +    vector<int> sumZero(int n) {
++
 +    }
 +};