Merge pull request #1999 from Hong-Study/main

[Hong-Study] WEEK 01 solutions

Author: Hong-Study

contains-duplicate/Hong-Study.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    bool containsDuplicate(vector<int>& nums) {
+        std::unordered_map<int, int> map;
+        for(const auto& num: nums){
+            if(map.find(num) != map.end()){
+                return true;
+            }
+
+            map[num] = 1;
+        }
+
+        return false;
+    }
+};
+

longest-consecutive-sequence/Hong-Study.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    int longestConsecutive(vector<int>& nums) {
+        std::set<int> sorts{nums.begin(), nums.end()};
+	
+	// 개선 필요...
+        int maxSequence = 0, sequence = 0, i = -1;
+        for (const auto& num : sorts) {
+            if (sorts.find(num + 1) != sorts.end()) {
+                sequence += 1;
+            } else {
+                maxSequence = std::max(maxSequence, sequence + 1);
+                sequence = 0;
+            }
+        }
+
+        return maxSequence;
+    }
+};
+

top-k-frequent-elements/Hong-Study.cpp

@@ -0,0 +1,29 @@
+class Solution {
+public:
+    vector<int> topKFrequent(vector<int>& nums, int k) {
+        std::unordered_map<int, int> maps;
+        for (const auto num : nums) {
+            if (maps.find(num) == maps.end())
+                maps[num] = 0;
+            maps[num] += 1;
+        }
+
+        std::vector<std::pair<int, int>> sorts{maps.begin(), maps.end()};
+        sort(sorts.begin(), sorts.end(),
+             [](std::pair<int, int> a, std::pair<int, int> b) {
+                 return a.second > b.second;
+             });
+
+        std::vector<int> result;
+        int i = 0;
+        for (const auto m : sorts) {
+            result.push_back(m.first);
+            i++;
+            if (i == k)
+                break;
+        }
+
+        return result;
+    }
+};
+

two-sum/Hong-Study.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+        std::map<int, int> numMap;
+        for (int i = 0; i < nums.size(); i++) {
+            int leftNum = target - nums[i];
+            if (numMap.find(leftNum) == numMap.end()) {
+                numMap[nums[i]] = i;
+                continue;
+            }
+
+            int idx = numMap[leftNum];
+            return std::vector<int>{idx, i};
+        }
+
+        return std::vector<int>{0, 0};
+    }
+};
+