feat: longest-consecutive-sequence, top-k-frequent-elements solve

Author: Real-Reason

longest-consecutive-sequence/Real-Reason.kt

@@ -0,0 +1,24 @@
+package leetcode_study
+class SolutionLongestConsecutiveSequence {
+    fun longestConsecutive(nums: IntArray): Int {
+        nums.sort()
+        var cnt = 0
+        var maxCnt = 0
+        nums.forEachIndexed { i, _ ->
+            if (i == 0) {
+                cnt = 1
+            }
+            else if (nums[i-1] == nums[i] - 1) {
+                cnt++
+            }
+            else if (nums[i - 1] == nums[i]) {
+                return@forEachIndexed
+            } else {
+                cnt = 1
+            }
+            maxCnt = maxOf(maxCnt, cnt)
+        }
+
+        return maxCnt
+    }
+}

top-k-frequent-elements/Real-Reason.kt

@@ -0,0 +1,15 @@
+package leetcode_study
+class SolutionTopKFrequentElements {
+    fun topKFrequent(nums: IntArray, k: Int): IntArray {
+        val numsCount = mutableMapOf<Int, Int>()
+        for (num in nums) {
+            val value = numsCount.getOrDefault(num, 0)
+            numsCount[num] = value + 1
+        }
+        val sortedNumsCount = numsCount.entries
+            .sortedByDescending { it.value }
+            .associate { it.toPair() }
+
+        return sortedNumsCount.keys.take(k).toIntArray()
+    }
+}