-Add: Longest Increasing Subsequence binary search

Author: BNSC1

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)
+}