Merge branch 'master' of https://github.com/BNSC1/leetcode-kotlin

Author: BNSC1

LeetCode/1944. Number of Visible People in a Queue.kt

@@ -0,0 +1,21 @@
+class Solution {
+    fun canSeePersonsCount(heights: IntArray): IntArray {
+        val size = heights.size
+        val res = IntArray(size)
+        val st = LinkedList<Int>()
+
+        for (i in size - 1 downTo 0) {
+            val curPerson = heights[i]
+
+            while (st.isNotEmpty()) {
+                val nextPerson = st.peek()
+
+                res[i]++
+                if (nextPerson > curPerson) break
+                else st.pop()
+            }
+            st.push(curPerson)
+        }
+        return res
+    }
+}

LeetCode/300. Longest Increasing Subsequence_binary search.kt

@@ -0,0 +1,15 @@
+class Solution {
+    fun lengthOfLIS(nums: IntArray): Int {
+        val sub = mutableListOf<Int>()
+        nums.forEach { num ->
+            if (sub.isEmpty() || sub.last() < num) {
+                sub.add(num)
+            } else {
+                val bin = sub.binarySearch(num)
+                val i = if (bin >= 0) bin else -bin - 1
+                sub[i] = num
+            }
+        }
+        return sub.size
+    } //TC: O(nlogn) SC: O(n)
+}