add 297

Author: luliyucoordinate

README.md

@@ -224,7 +224,7 @@ LeetCode
 |0287|[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | c | [c++](./src/00287-Find-the-Duplicate-Number/0287.cpp) |[python](./src/0287-Find-the-Duplicate-Number/0287.py)|||Medium|
 |0289|[Game of Life](https://leetcode.com/problems/game-of-life/) | c | [c++](./src/0289-Game-of-Life/0289.cpp) |[python](./src/0289-Game-of-Life/0289.py)|||Medium|
 |0290|[Word Pattern](https://leetcode.com/problems/word-pattern/) | c | [c++](./src/0290-Word-Pattern/0290.cpp) |[python](./src/0290-Word-Pattern/0290.py)|||Easy|
-|0297|[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | c | [c++](./src/0297-Serialize-and-Deserialize-Binary-Tree/0297.cpp) |[python](./src/0297-Serialize-and-Deserialize-Binary-Tree/0297.py)|||Hard|
+|0297|[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | c | [c++](./src/0297-Serialize-and-Deserialize-Binary-Tree/0297.cpp) |[python](./src/0297-Serialize-and-Deserialize-Binary-Tree/0297.py)||[js](./src/0297-Serialize-and-Deserialize-Binary-Tree/0297.js)|Hard|
 |0300|[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | c | [c++](./src/0300-Longest-Increasing-Subsequence/0300.cpp) |[python](./src/0300-Longest-Increasing-Subsequence/0300.py)|||Medium|
 |0303|[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/) | c | [c++](./src/0303-Range-Sum-Query-Immutable/0303.cpp) |[python](./src/0303-Range-Sum-Query-Immutable/0303.py)|||Easy|
 |0307|[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/) | c | [c++](./src/0307-Range-Sum-Query-Mutable/0307.cpp) |[python](./src/0307-Range-Sum-Query-Mutable/0307.py)|[go](./src/0307-Range-Sum-Query-Mutable/0307.go)|[js](./src/0307-Range-Sum-Query-Mutable/0307.js)|Medium|
@@ -275,7 +275,7 @@ LeetCode
 |0560|[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | c | [c++](./src/0560-Subarray-Sum-Equals-K/0560.cpp) |[python](./src/0560-Subarray-Sum-Equals-K/0560.py)|||Medium|
 |0637|[Average of Levels in Binary Tree](https://leetcode.com/problems/subarray-sum-equals-k/) | c | [c++](./src/0637-Average-of-Levels-in-Binary-Tree/0637.cpp) |[python](./src/0637-Average-of-Levels-in-Binary-Tree/0637.py)|||Easy|
 |0650|[2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard/) | c | [c++](./src/0650-2-Keys-Keyboard/0650.cpp) |[python](./src/0650-2-Keys-Keyboard/0650.py)|||Medium|
-|0652|[Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/) | c | [c++](./src/0652-Find-Duplicate-Subtrees/0652.cpp) |[python](./src/0652-Find-Duplicate-Subtrees/0652.py)|||Medium|
+|0652|[Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/) | c | [c++](./src/0652-Find-Duplicate-Subtrees/0652.cpp) |[python](./src/0652-Find-Duplicate-Subtrees/0652.py)|[go](./src/0652-Find-Duplicate-Subtrees/0652.go)|[js](./src/0652-Find-Duplicate-Subtrees/0652.js)|Medium|
 |0653|[Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/) | c | [c++](./src/0653-Two-Sum-IV-Input-is-a-BST/0653.cpp) |[python](./src/0653-Two-Sum-IV-Input-is-a-BST/0653.py)|||Easy|
 |0654|[Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree/) | c | [c++](./src/0654-Maximum-Binary-Tree/0654.cpp) |[python](./src/0654-Maximum-Binary-Tree/0654.py)|||Medium|
 |0684|[Redundant Connection](https://leetcode.com/problems/redundant-connection/) | c | [c++](./src/0684-Redundant-Connection/0684.cpp) |[python](./src/0684-Redundant-Connection/0684.py)|||Medium|

src/0297-Serialize-and-Deserialize-Binary-Tree/0297.cpp

@@ -0,0 +1,42 @@
+class Codec 
+{
+public:
+
+    // Encodes a tree to a single string.
+    string serialize(TreeNode* root) 
+    {
+        preOrder(root);
+        return res;
+    }
+
+    // Decodes your encoded data to tree.
+    TreeNode* deserialize(string data) 
+    {
+        stringstream in(data);
+        return deOrder(in);
+    }
+private:
+    string res;
+    
+    void preOrder(TreeNode* root)
+    {
+        if (root == nullptr) 
+        {
+            res += "# "; return ;
+        }
+        res += to_string(root->val) + ' ';
+        preOrder(root->left);
+        preOrder(root->right);
+    }
+    
+    TreeNode* deOrder(stringstream& in) 
+    {
+        string val;
+        in >> val;
+        if (val == "#") return nullptr;
+        TreeNode* root = new TreeNode(stoi(val));
+        root->left = deOrder(in);
+        root->right = deOrder(in);   
+        return root;
+    }
+};

src/0297-Serialize-and-Deserialize-Binary-Tree/0297.js

@@ -0,0 +1,38 @@
+/**
+ * Encodes a tree to a single string.
+ *
+ * @param {TreeNode} root
+ * @return {string}
+ */
+var serialize = function(root) {
+    let res = "";
+    let postOrder = function(root) {
+        if (root == null) {
+            res += "# "; return;
+        }
+        postOrder(root.left);
+        postOrder(root.right);
+        res += root.val + " ";
+    }
+    postOrder(root);
+    return res;
+};
+
+/**
+ * Decodes your encoded data to tree.
+ *
+ * @param {string} data
+ * @return {TreeNode}
+ */
+var deserialize = function(data) {
+    let datas = data.split(" "); datas.pop();
+    let deOrder = function() {
+        let val = datas.pop();
+        if (val == "#") return null;
+        let root = new TreeNode(Number(val));
+        root.right = deOrder();
+        root.left = deOrder();
+        return root;
+    }
+    return deOrder();
+};

src/0297-Serialize-and-Deserialize-Binary-Tree/0297.py

@@ -0,0 +1,35 @@
+class Codec:
+    def serialize(self, root):
+        """Encodes a tree to a single string.
+        
+        :type root: TreeNode
+        :rtype: str
+        """
+        res = ""
+        def postOrder(root):
+            nonlocal res
+            if not root:
+                res += '# '
+                return 
+            postOrder(root.left)
+            postOrder(root.right)
+            res += str(root.val) + ' '
+        postOrder(root)
+        return res
+            
+    def deserialize(self, data):
+        """Decodes your encoded data to tree.
+        
+        :type data: str
+        :rtype: TreeNode
+        """
+        datas = data.split()
+        def deOrder():
+            val = datas.pop()
+            if val == '#':
+                return 
+            root = TreeNode(int(val))
+            root.right = deOrder()
+            root.left = deOrder()
+            return root
+        return deOrder()