feat: add longest increasing subsequence in rs

Author: bujosa

src/medium/longest_increasing_subsequence.rs

@@ -0,0 +1,26 @@
+#![allow(dead_code)]
+pub fn length_of_lis(nums: Vec<i32>) -> i32 {
+    if nums.is_empty() {
+        return 0;
+    }
+    let mut dp = vec![1; nums.len()];
+    for i in 0..nums.len() {
+        for j in 0..i {
+            if nums[i] > nums[j] {
+                dp[i] = dp[i].max(dp[j] + 1);
+            }
+        }
+    }
+    *dp.iter().max().unwrap()
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_length_of_lis() {
+        assert_eq!(length_of_lis(vec![10, 9, 2, 5, 3, 7, 101, 18]), 4);
+        assert_eq!(length_of_lis(vec![0, 1, 0, 3, 2, 3]), 4);
+    }
+}

src/readme.md

@@ -89,7 +89,7 @@
   - [x] [238. Product of array except self](../src/medium/product_of_array_except_self.rs) -> [Problem Description](../src/medium/readme.md#238-product-of-array-except-self)
   - [x] [271. Encode and decode strings](../src/medium/encode_and_decode_strings.rs) -> [Problem Description](../src/medium/readme.md#271-encode-and-decode-strings)
   - [x] [287. Find the duplicate number](../src/medium/find_the_duplicate_number.rs) -> [Problem Description](../src/medium/readme.md#287-find-the-duplicate-number)
-  - [ ] [300. Longest increasing subsequence](../src/medium/longest_increasing_subsequence.rs) -> [Problem Description](../src/medium/readme.md#300-longest-increasing-subsequence)
+  - [x] [300. Longest increasing subsequence](../src/medium/longest_increasing_subsequence.rs) -> [Problem Description](../src/medium/readme.md#300-longest-increasing-subsequence)
   - [x] [322. Coin change](../src/medium/coin_change.rs) -> [Problem Description](../src/medium/readme.md#322-coin-change)
   - [x] [347. Top k frequent elements](../src/medium/top_k_frequent_elements.rs) -> [Problem Description](../src/medium/readme.md#347-top-k-frequent-elements)
   - [x] [355. Design twitter](../src/medium/design_twitter.rs) -> [Problem Description](../src/medium/readme.md#355-design-twitter)

theory/categories/6.1d_dp/readme.md

@@ -29,7 +29,7 @@ Dynamic programming and greedy algorithms are similar. Both are optimization met
 - [x] [Coin Change](https://leetcode.com/problems/coin-change/) | Medium | [Solution](../../../src/medium/coin_change.rs) | [Problem Description](../../../src/medium/readme.md#322-coin-change)
 - [x] [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | Medium | [Solution](../../../src/medium/maximum_product_subarray.rs) | [Problem Description](../../../src/medium/readme.md#152-maximum-product-subarray)
 - [x] [Word Break](https://leetcode.com/problems/word-break/) | Medium | [Solution](../../../src/medium/word_break.rs) | [Problem Description](../../../src/medium/readme.md#139-word-break)
-- [ ] [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | Medium | [Solution](../../../src/medium/longest_increasing_subsequence.rs) | [Problem Description](../../../src/medium/readme.md#300-longest-increasing-subsequence)
+- [x] [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | Medium | [Solution](../../../src/medium/longest_increasing_subsequence.rs) | [Problem Description](../../../src/medium/readme.md#300-longest-increasing-subsequence)
 - [ ] [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) | Medium | [Solution](../../../src/medium/partition_equal_subset_sum.rs) | [Problem Description](../../../src/medium/readme.md#416-partition-equal-subset-sum)