GH-140: Solve leetcode 347 (#163)

rain1024 · web-flow · commit ae6cfdbca5b9 · 2023-02-26T08:37:59.000+07:00
diff --git a/.vscode/launch.json b/.vscode/launch.json
@@ -1,6 +1,23 @@
 {
   "version": "0.2.0",
   "configurations": [
+    {
+      "name": "Python: Current File",
+      "type": "python",
+      "request": "launch",
+      "program": "${file}",
+      "console": "integratedTerminal",
+      "justMyCode": true
+    },
+    {
+      "name": "Python: Craft",
+      "type": "python",
+      "request": "launch",
+      "program": "${file}",
+      "console": "integratedTerminal",
+      "justMyCode": true,
+      "args": ["leetcode", "347"]
+    },
     {
       "name": "Debug C++",
       "type": "cppdbg",
@@ -15,4 +32,4 @@
       "preLaunchTask": "C++: g++ build active file"
     }
   ]
-}
+}
diff --git a/problems/leetcode347/.gitignore b/problems/leetcode347/.gitignore
@@ -0,0 +1 @@
+solution
diff --git a/problems/leetcode347/README.md b/problems/leetcode347/README.md
@@ -0,0 +1,19 @@
+# Leetcode Problem 
+
+## Usage
+
+Run program with an example
+
+```
+bazel run src/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
+```
diff --git a/problems/leetcode347/data/1.in b/problems/leetcode347/data/1.in
@@ -0,0 +1,2 @@
+6 2
+1 1 1 2 2 3
diff --git a/problems/leetcode347/data/1.out b/problems/leetcode347/data/1.out
@@ -0,0 +1 @@
+1 2
diff --git a/problems/leetcode347/data/2.in b/problems/leetcode347/data/2.in
@@ -0,0 +1,2 @@
+1 1
+1
diff --git a/problems/leetcode347/data/2.out b/problems/leetcode347/data/2.out
@@ -0,0 +1 @@
+1
diff --git a/problems/leetcode347/data/3.in b/problems/leetcode347/data/3.in
@@ -0,0 +1,2 @@
+7 2
+4 1 -1 2 -1 2 3
diff --git a/problems/leetcode347/data/3.out b/problems/leetcode347/data/3.out
@@ -0,0 +1,3 @@
+2
+1
+0
diff --git a/problems/leetcode347/problem_infos.json b/problems/leetcode347/problem_infos.json
@@ -0,0 +1,14 @@
+{
+  "name": "Leetcode 347. Top K Frequent Elements",
+  "link": "https://leetcode.com/problems/top-k-frequent-elements/description/",
+  "tags": [
+    "Array",
+    "Hash Table",
+    "Divide and Conquer",
+    "Sorting",
+    "Heap (Priority Queue)",
+    "Bucket Sort",
+    "Counting",
+    "Quickselect"
+  ]
+}
diff --git a/problems/leetcode347/src/main/BUILD b/problems/leetcode347/src/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"],
+)
diff --git a/problems/leetcode347/src/main/solution.cpp b/problems/leetcode347/src/main/solution.cpp
@@ -0,0 +1,32 @@
+#include <cmath>
+#include <vector>
+#include <map>
+#include <algorithm>
+#include <string>
+#include <iostream>
+#include "solution.h"
+
+using namespace std;
+
+int main(){
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+  
+  // get input
+  int k, n;
+  cin >> n >> k;
+  vector<int> nums(n);
+  for(int i = 0; i < n; i++){
+    cin >> nums[i];
+  }
+
+  Solution solution;
+  vector<int> v = solution.topKFrequent(nums, k);
+
+  // print output
+  for(auto i: v){
+    cout << i << " ";
+  }
+  
+  return 0;
+}
diff --git a/problems/leetcode347/src/main/solution.h b/problems/leetcode347/src/main/solution.h
@@ -0,0 +1,32 @@
+#include <algorithm>
+#include <cmath>
+#include <map>
+#include <set>
+#include <string>
+#include <unordered_map>
+#include <vector>
+
+using namespace std;
+
+class Solution {
+public:
+    vector<int> topKFrequent(vector<int>& nums, int k) {
+        map<int, int> counter;
+        for(auto num: nums){
+            counter[num] += 1;
+        }
+        auto cmp = [](const pair<int, int>& a, const pair<int, int>& b) {
+            return a.second > b.second;
+        };
+        vector<pair<int, int>> sorted_counter(counter.begin(), counter.end());
+        sort(sorted_counter.begin(), sorted_counter.end(), cmp);
+        vector<int> topK;
+        transform(
+            sorted_counter.begin(),
+            next(sorted_counter.begin(), k),
+            back_inserter(topK), [](const auto& p){
+                return p.first;
+            });
+        return topK;
+    }
+};
diff --git a/problems/leetcode347/tests/BUILD b/problems/leetcode347/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"]
+)
diff --git a/problems/leetcode347/tests/solution_test.cpp b/problems/leetcode347/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();
+}
