feat: update solutions to lc problem: No.0300

No.0300.Longest Increasing Subsequence

Author: yanglbme

solution/0300-0399/0300.Longest Increasing Subsequence/README.md

@@ -134,7 +134,6 @@ class Solution:
 ```python
 class Solution:
     def lengthOfLIS(self, nums: List[int]) -> int:
-        n = len(nums)
         d = [nums[0]]
         for x in nums[1:]:
             if x > d[-1]:
@@ -481,8 +480,7 @@ func max(a, b int) int {
 
 ```go
 func lengthOfLIS(nums []int) int {
-	n := len(nums)
-	d := make([]int, n+1)
+	d := make([]int, len(nums)+1)
 	d[1] = nums[0]
 	size := 1
 	for _, x := range nums[1:] {

solution/0300-0399/0300.Longest Increasing Subsequence/README_EN.md

@@ -69,7 +69,6 @@ Greedy & Binary search:
 ```python
 class Solution:
     def lengthOfLIS(self, nums: List[int]) -> int:
-        n = len(nums)
         d = [nums[0]]
         for x in nums[1:]:
             if x > d[-1]:
@@ -414,8 +413,7 @@ Greedy & Binary search:
 
 ```go
 func lengthOfLIS(nums []int) int {
-	n := len(nums)
-	d := make([]int, n+1)
+	d := make([]int, len(nums)+1)
 	d[1] = nums[0]
 	size := 1
 	for _, x := range nums[1:] {

solution/0300-0399/0300.Longest Increasing Subsequence/Solution.cpp

@@ -1,49 +1,18 @@
-class BinaryIndexedTree {
-public:
-    int n;
-    vector<int> c;
-
-    BinaryIndexedTree(int _n): n(_n), c(_n + 1){}
-
-    void update(int x, int val) {
-        while (x <= n)
-        {
-            c[x] = max(c[x], val);
-            x += lowbit(x);
-        }
-    }
-
-    int query(int x) {
-        int s = 0;
-        while (x > 0)
-        {
-            s = max(s, c[x]);
-            x -= lowbit(x);
-        }
-        return s;
-    }
-
-    int lowbit(int x) {
-        return x & -x;
-    }
-};
-
-class Solution {
-public:
-    int lengthOfLIS(vector<int>& nums) {
-        set<int> s(nums.begin(), nums.end());
-        int idx = 1;
-        unordered_map<int, int> m;
-        for (int v : s) m[v] = idx++;
-        BinaryIndexedTree* tree = new BinaryIndexedTree(m.size());
-        int ans = 1;
-        for (int v : nums)
-        {
-            int x = m[v];
-            int t = tree->query(x - 1) + 1;
-            ans = max(ans, t);
-            tree->update(x, t);
-        }
-        return ans;
-    }
+class Solution {
+public:
+    int lengthOfLIS(vector<int>& nums) {
+        int n = nums.size();
+        vector<int> d{nums[0]};
+        for (int i = 1; i < n; ++i)
+        {
+            if (nums[i] > d[d.size() - 1]) d.push_back(nums[i]);
+            else
+            {
+                int idx = lower_bound(d.begin(), d.end(), nums[i]) - d.begin();
+                if (idx == d.size()) idx = 0;
+                d[idx] = nums[i];
+            }
+        }
+        return d.size();
+    }
 };

solution/0300-0399/0300.Longest Increasing Subsequence/Solution.go

@@ -1,60 +1,26 @@
-type BinaryIndexedTree struct {
-	n int
-	c []int
-}
-
-func newBinaryIndexedTree(n int) *BinaryIndexedTree {
-	c := make([]int, n+1)
-	return &BinaryIndexedTree{n, c}
-}
-
-func (this *BinaryIndexedTree) lowbit(x int) int {
-	return x & -x
-}
-
-func (this *BinaryIndexedTree) update(x, val int) {
-	for x <= this.n {
-		if this.c[x] < val {
-			this.c[x] = val
-		}
-		x += this.lowbit(x)
-	}
-}
-
-func (this *BinaryIndexedTree) query(x int) int {
-	s := 0
-	for x > 0 {
-		if s < this.c[x] {
-			s = this.c[x]
-		}
-		x -= this.lowbit(x)
-	}
-	return s
-}
-
-func lengthOfLIS(nums []int) int {
-	s := make(map[int]bool)
-	for _, v := range nums {
-		s[v] = true
-	}
-	var t []int
-	for v, _ := range s {
-		t = append(t, v)
-	}
-	sort.Ints(t)
-	m := make(map[int]int)
-	for i, v := range t {
-		m[v] = i + 1
-	}
-	ans := 1
-	tree := newBinaryIndexedTree(len(m))
-	for _, v := range nums {
-		x := m[v]
-		t := tree.query(x-1) + 1
-		if ans < t {
-			ans = t
-		}
-		tree.update(x, t)
-	}
-	return ans
+func lengthOfLIS(nums []int) int {
+	d := make([]int, len(nums)+1)
+	d[1] = nums[0]
+	size := 1
+	for _, x := range nums[1:] {
+		if x > d[size] {
+			size++
+			d[size] = x
+		} else {
+			left, right := 1, size
+			for left < right {
+				mid := (left + right) >> 1
+				if d[mid] >= x {
+					right = mid
+				} else {
+					left = mid + 1
+				}
+			}
+			if d[left] < x {
+				left = 1
+			}
+			d[left] = x
+		}
+	}
+	return size
 }

solution/0300-0399/0300.Longest Increasing Subsequence/Solution.java

@@ -1,52 +1,26 @@
-class Solution {
-    public int lengthOfLIS(int[] nums) {
-        TreeSet<Integer> ts = new TreeSet();
-        for (int v : nums) {
-            ts.add(v);
-        }
-        int idx = 1;
-        Map<Integer, Integer> m = new HashMap<>();
-        for (int v : ts) {
-            m.put(v, idx++);
-        }
-        BinaryIndexedTree tree = new BinaryIndexedTree(m.size());
-        int ans = 1;
-        for (int v : nums) {
-            int x = m.get(v);
-            int t = tree.query(x - 1) + 1;
-            ans = Math.max(ans, t);
-            tree.update(x, t);
-        }
-        return ans;
-    }
-}
-
-class BinaryIndexedTree {
-    private int n;
-    private int[] c;
-
-    public BinaryIndexedTree(int n) {
-        this.n = n;
-        c = new int[n + 1];
-    }
-
-    public void update(int x, int val) {
-        while (x <= n) {
-            c[x] = Math.max(c[x], val);
-            x += lowbit(x);
-        }
-    }
-
-    public int query(int x) {
-        int s = 0;
-        while (x > 0) {
-            s = Math.max(s, c[x]);
-            x -= lowbit(x);
-        }
-        return s;
-    }
-
-    public static int lowbit(int x) {
-        return x & -x;
-    }
+class Solution {
+    public int lengthOfLIS(int[] nums) {
+        int n = nums.length;
+        int[] d = new int[n + 1];
+        d[1] = nums[0];
+        int size = 1;
+        for (int i = 1; i < n; ++i) {
+            if (nums[i] > d[size]) {
+                d[++size] = nums[i];
+            } else {
+                int left = 1, right = size;
+                while (left < right) {
+                    int mid = (left + right) >> 1;
+                    if (d[mid] >= nums[i]) {
+                        right = mid;
+                    } else {
+                        left = mid + 1;
+                    }
+                }
+                int p = d[left] >= nums[i] ? left : 1;
+                d[p] = nums[i];
+            }
+        }
+        return size;
+    }
 }

solution/0300-0399/0300.Longest Increasing Subsequence/Solution.py

@@ -1,34 +1,12 @@
-class BinaryIndexedTree:
-    def __init__(self, n):
-        self.n = n
-        self.c = [0] * (n + 1)
-
-    @staticmethod
-    def lowbit(x):
-        return x & -x
-
-    def update(self, x, val):
-        while x <= self.n:
-            self.c[x] = max(self.c[x], val)
-            x += BinaryIndexedTree.lowbit(x)
-
-    def query(self, x):
-        s = 0
-        while x:
-            s = max(s, self.c[x])
-            x -= BinaryIndexedTree.lowbit(x)
-        return s
-
-
-class Solution:
-    def lengthOfLIS(self, nums: List[int]) -> int:
-        s = sorted(set(nums))
-        m = {v: i for i, v in enumerate(s, 1)}
-        tree = BinaryIndexedTree(len(m))
-        ans = 1
-        for v in nums:
-            x = m[v]
-            t = tree.query(x - 1) + 1
-            ans = max(ans, t)
-            tree.update(x, t)
-        return ans
+class Solution:
+    def lengthOfLIS(self, nums: List[int]) -> int:
+        d = [nums[0]]
+        for x in nums[1:]:
+            if x > d[-1]:
+                d.append(x)
+            else:
+                idx = bisect_left(d, x)
+                if idx == len(d):
+                    idx = 0
+                d[idx] = x
+        return len(d)