Gh-169: Solve leetcode 106 (#225)

Author: rain1024

collections/leetcode/README.md

@@ -124,7 +124,7 @@
 <td>103</td>
 <td>104</td>
 <td>105</td>
-<td>106</td>
+<td>🟡&nbsp;<a href='https://github.com/rain1024/datastructures-algorithms-competitive-programming/tree/main/problems/leetcode106'>106</a></td>
 <td>107</td>
 <td>108</td>
 <td>109</td>

collections/leetcode/data.yaml

@@ -20,6 +20,9 @@ problems:
 - name: 101
   languages: cpp
   level: easy
+- name: 106
+  languages: cpp
+  level: medium
 - name: 125
   languages: cpp
   level: easy

problems/leetcode106/.gitignore

@@ -0,0 +1,2 @@
+solution
+*.dSYM

problems/leetcode106/README.md

@@ -0,0 +1,19 @@
+# Leetcode Problem 
+
+## Usage
+
+Run program with an example
+
+```
+bazel run cpp/main:solution < data/1.in
+```
+
+Test program
+
+```
+# Run all tests
+bazel test --test_output=all tests:solution_test
+bazel test --test_output=all --cache_test_results=no tests:solution_test
+# Run test with pecific test id
+bazel test --test_output=all tests:solution_test --test_arg=1
+```

problems/leetcode106/cpp/main/BUILD

@@ -0,0 +1,7 @@
+load("@rules_cc//cc:defs.bzl", "cc_binary")
+
+cc_binary(
+    name = "solution",
+    srcs = ["solution.cpp", "solution.h"],
+    visibility = ["//visibility:public"],
+)

problems/leetcode106/cpp/main/solution.cpp

@@ -0,0 +1,48 @@
+#include "solution.h"
+
+#include <algorithm>
+#include <cmath>
+#include <iostream>
+#include <map>
+#include <string>
+#include <vector>
+#include <fstream>
+
+using namespace std;
+
+int main() {
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+
+  bool is_use_file = false;
+
+  filesystem::path filepath =
+      filesystem::current_path().parent_path().parent_path() / "data" / "1.in";
+  ifstream file(filepath);
+
+  if (is_use_file) {
+    cin.rdbuf(file.rdbuf());  // redirect cin to file
+  }
+
+  // get input
+  int x;
+  cin >> x;
+
+  vector<int> inorder;
+  for(int i=0; i<x; i++){
+    cin >> inorder[x];
+  }
+
+  vector<int> postorder;
+  for(int i=0; i<x; i++){
+    cin >> postorder[x];
+  }
+
+  Solution solution;
+  TreeNode* tree = solution.buildTree(inorder, postorder);
+
+  // print output
+  cout << tree->val << endl;
+
+  return 0;
+}

problems/leetcode106/cpp/main/solution.h

@@ -0,0 +1,71 @@
+#include <algorithm>
+#include <cmath>
+#include <map>
+#include <set>
+#include <string>
+#include <unordered_map>
+#include <vector>
+#include <stack>
+#include <queue>
+
+using namespace std;
+
+// Definition for a binary tree node.
+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* solve(vector<int>&inorder, vector<int>& postorder, int i0, int i1, int p0, int p1){
+        if(p0 == p1){
+            return new TreeNode(postorder[p0]);
+        }
+        int val = postorder[p1];
+        TreeNode* root = new TreeNode(val);
+        int index;
+        // search val in inorder
+        for(int i=i0; i<=i1; i++){
+            if(inorder[i] == val){
+                index = i;
+                break;
+            }
+        }
+        TreeNode* left;
+        TreeNode* right;
+        if(index == i0){
+            left = nullptr;
+        } else {
+            left = solve(
+                inorder, postorder,
+                i0, index-1,
+                p0, p0 + index - i0 -1
+            );
+        }
+        root->left = left;
+        
+        if(index == i1){
+            right = nullptr;
+        } else {
+            int size = i1 - (index + 1);
+            right = solve(
+                inorder, postorder,
+                index+1, i1,
+                p1-1-size, p1-1
+            );
+        }
+        root->right = right;
+        return root;
+    }
+    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
+        return solve(
+            inorder, postorder,
+            0, inorder.size()-1,
+            0, postorder.size()-1);
+    }
+};

problems/leetcode106/cpp/tests/BUILD

@@ -0,0 +1,11 @@
+load("@rules_cc//cc:defs.bzl", "cc_binary", "cc_test")
+
+cc_test(
+    name = "solution_test",
+    srcs = ["solution_test.cpp"],
+    deps = [
+      "//problems/codeforcesAA/src/main:solution",
+      "@com_google_googletest//:gtest_main",
+    ],
+    data = ["data"]
+)

problems/leetcode106/cpp/tests/solution_test.cpp

@@ -0,0 +1,97 @@
+#include <cstdlib>
+#include <filesystem>
+#include <fstream>
+#include <iostream>
+#include <string>
+#include <string_view>
+#include <vector>
+
+#include "gtest/gtest.h"
+
+namespace fs = std::filesystem;
+
+using namespace std;
+
+std::string TEST_ID = "";
+
+vector<string> split(string s, string delimiter) {
+  size_t pos_start = 0, pos_end, delim_len = delimiter.length();
+  string token;
+  vector<string> res;
+
+  while ((pos_end = s.find(delimiter, pos_start)) != string::npos) {
+    token = s.substr(pos_start, pos_end - pos_start);
+    pos_start = pos_end + delim_len;
+    res.push_back(token);
+  }
+
+  res.push_back(s.substr(pos_start));
+  return res;
+}
+
+std::string GetHello(std::string_view in) {
+  if (in.size() == 0) {
+    return std::string("hello, word");
+  } else {
+    return std::string("Hello, ") + in.data();
+  }
+}
+
+string ReadFile(const std::string &filename) {
+  std::ifstream f(filename);
+  string s((std::istreambuf_iterator<char>(f)),
+           std::istreambuf_iterator<char>());
+  return s;
+}
+
+vector<string> RunProgram(string fileid) {
+  vector<string> v;
+  string program = "problems/codeforcesAA/src/main/solution";
+  string test_folder = "problems/codeforcesAA/tests/data/";
+  string command = program + " < " + test_folder + fileid + ".in > output.txt";
+  std::system(command.c_str());
+  string actual = ReadFile("output.txt");
+  string expectedOutputFile = test_folder + fileid + ".out";
+  string expected = ReadFile(expectedOutputFile);
+  v.push_back(actual);
+  v.push_back(expected);
+  return v;
+}
+
+TEST(RunTest, AllTestCases) {
+  if (TEST_ID != "") {
+    std::cout << "TEST_ID = " << TEST_ID << std::endl;
+  } else {
+    std::cout << "RUN ALL TESTS" << std::endl;
+  }
+
+  std::string test_data_folder = "problems/codeforcesAA/tests/data";
+  for (const auto &entry : fs::directory_iterator(test_data_folder)) {
+    string filename = split(entry.path(), "/").back();
+    vector<string> v = split(filename, ".");
+    string fileid = v[0];
+    string extension = v[1];
+    if (extension != "in"){
+      continue;
+    }
+    if (TEST_ID != ""){
+      if (fileid != TEST_ID){
+        continue;
+      }
+    }
+    // Run Test Case
+    vector<string> output = RunProgram(fileid);
+    string actual = output[0];
+    string expected = output[1];
+    string message = "❌ FAIL CASE: " + fileid;
+    ASSERT_EQ(actual, expected) << message;
+  }
+}
+
+int main(int argc, char **argv) {
+  ::testing::InitGoogleTest(&argc, argv);
+  if (argc == 2) {
+    TEST_ID = argv[1];
+  }
+  return RUN_ALL_TESTS();
+}

problems/leetcode106/data/1.in

@@ -0,0 +1,3 @@
+5
+9 3 15 20 7
+9 15 7 20 3

problems/leetcode106/data/1.out

@@ -0,0 +1,3 @@
+1
+-1
+-1

problems/leetcode106/data/2.in

@@ -0,0 +1,9 @@
+{
+  "name": "Leetcode 78. Subsets",
+  "link": "https://leetcode.com/problems/subsets/",
+  "tags": [
+    "Array",
+    "Backtracking",
+    "Bit Manipulation"
+  ]
+}