Merge pull request #537 from aishwarya-chandra/day9q1

day9q1

Day 9/q1: Longest Increasing Subsequence/aishwarya--J.md

@@ -0,0 +1,23 @@
+```
+Using Binary Search
+class Solution {
+    public int lengthOfLIS(int[] nums) {
+        int[] tails = new int[nums.length];
+        int size = 0;
+        for (int x : nums) {
+            int i = 0, j = size;
+            while (i != j) {
+                int m = (i + j) / 2;
+                if (tails[m] < x)
+                    i = m + 1;
+                else
+                    j = m;
+            }
+            tails[i] = x;
+            if (i == size) ++size;
+        }
+        return size;
+    }
+}
+
+```