0100 new algo added.

liuyubobobo · liuyubobobo · commit f9fbc4f4363b · 2019-03-11T00:27:47.000-07:00
diff --git a/0100-Same-Tree/cpp-0100/CMakeLists.txt b/0100-Same-Tree/cpp-0100/CMakeLists.txt
@@ -3,5 +3,5 @@ project(cpp_0100)
 
 set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
 
-set(SOURCE_FILES main.cpp)
+set(SOURCE_FILES main3.cpp)
 add_executable(cpp_0100 ${SOURCE_FILES})
diff --git a/0100-Same-Tree/cpp-0100/main3.cpp b/0100-Same-Tree/cpp-0100/main3.cpp
@@ -0,0 +1,55 @@
+/// Source : https://leetcode.com/problems/same-tree/description/
+/// Author : liuyubobobo
+/// Time   : 2019-03-11
+
+#include <iostream>
+#include <stack>
+
+using namespace std;
+
+
+/// Iterative
+/// Time Complexity: O(n)
+/// Space Complexity: O(h)
+
+/// 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:
+    bool isSameTree(TreeNode* p, TreeNode* q) {
+
+        stack<TreeNode*> stack1, stack2;
+        stack1.push(p), stack2.push(q);
+        while(!stack1.empty() || !stack2.empty()){
+            TreeNode* cur1 = stack1.top();
+            stack1.pop();
+
+            TreeNode* cur2 = stack2.top();
+            stack2.pop();
+
+            if(cur1 && !cur2) return false;
+            if(!cur1 && cur2) return false;
+            if(!cur1 && !cur2) continue;
+
+            if(cur1->val != cur2->val) return false;
+            stack1.push(cur1->right);
+            stack1.push(cur1->left);
+            stack2.push(cur2->right);
+            stack2.push(cur2->left);
+        }
+
+        return stack1.empty() && stack2.empty();
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -133,7 +133,7 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | | | | | | |
 | 098 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/description/) | [solution](https://leetcode.com/problems/validate-binary-search-tree/solution/) | [C++](0098-Validate-Binary-Search-Tree/cpp-0098/) | [Java](0098-Validate-Binary-Search-Tree/java-0098/src/) | |
 | 099 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/description/) | [无] | | [Java](0099-Recover-Binary-Search-Tree/java-0099/src/) | |
-| 100 | [Same Tree](https://leetcode.com/problems/same-tree/description/) | [无] | [C++](0100-Same-Tree/cpp-0100/) | | |
+| 100 | [Same Tree](https://leetcode.com/problems/same-tree/description/) | [solution](https://leetcode.com/problems/same-tree/solution/) | [C++](0100-Same-Tree/cpp-0100/) | | |
 | 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/description/) | [solution](https://leetcode.com/problems/symmetric-tree/solution/) | [C++](0101-Symmetric-Tree/cpp-0101/) | | |
 | 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/description/) | [无] | [C++](0102-Binary-Tree-Level-Order-Traversal/cpp-0102/) | [Java](0102-Binary-Tree-Level-Order-Traversal/java-0102/src/) | |
 | | | | | | |
