12/22/2020

Author: safrannn

README.md

@@ -101,6 +101,7 @@ leetcode practise solution in rust
 |496|[Next Greater Element I](src/_0496_next_greater_element_i.rs)|
 |503|[Next Greater Element II](src/_0503_next_greater_element_ii.rs)|
 |509|[Fibonacci Number](src/_0509_fibonacci_number.rs)|
+|516|[Longest Palindromic Subsequence](src/_0516_longest_palindromic_subsequence.rs)|
 |518|[Coin Change 2](src/_0518_coin_change_2.rs)|
 |520|[Detect Capital](src/_0520_detect_capital.rs)|
 |532|[K-diff Pairs in an Array](src/_0532_kdiff_pairs_in_an_array.rs)|

src/_0516_longest_palindromic_subsequence.rs

@@ -2,6 +2,29 @@ struct Solution;
 
 impl Solution {
     pub fn longest_palindrome_subseq(s: String) -> i32 {
-        0
+        let s = s.as_bytes();
+        let n = s.len();
+        let mut dp: Vec<Vec<i32>> = vec![vec![0; n]; n + 1];
+
+        for i in 0..n {
+            dp[1][i] = 1;
+        }
+
+        for length in 2..=n {
+            for start in 0..=n - length {
+                dp[length][start] = if s[start] == s[start + length - 1] {
+                    dp[length - 2][start + 1] + 2
+                } else {
+                    dp[length - 1][start].max(dp[length - 1][start + 1])
+                }
+            }
+        }
+        dp[n][0]
     }
 }
+
+#[test]
+fn test() {
+    assert_eq!(Solution::longest_palindrome_subseq("bbbab".to_string()), 4);
+    assert_eq!(Solution::longest_palindrome_subseq("cbbd".to_string()), 2);
+}

src/_0518_coin_change_2.rs

@@ -16,4 +16,8 @@ impl Solution {
 }
 
 #[test]
-fn test() {}
+fn test() {
+    assert_eq!(Solution::change(5, vec![1, 2, 5]), 4);
+    assert_eq!(Solution::change(3, vec![2]), 0);
+    assert_eq!(Solution::change(10, vec![10]), 1);
+}