feat(leetcode/983): kandane-like

src/leetcode/algorithm_983/README.md

@@ -0,0 +1,3 @@
+Minimum Cost For Tickets
+========================
+[leetcode](https://leetcode.com/problems/minimum-cost-for-tickets)

src/leetcode/algorithm_983/mod.rs

@@ -0,0 +1,45 @@
+pub struct Solution;
+
+impl Solution {
+    pub fn mincost_tickets(days: Vec<i32>, costs: Vec<i32>) -> i32 {
+        let mut mins = vec![*costs.iter().min().unwrap()];
+        let mut next = vec![1, 1];
+        for (i, d) in days.iter().enumerate().skip(1) {
+            while next[0] > 0 && next[0] < i && d - days[next[0] - 1] > 7 {
+                next[0] += 1;
+            }
+            while next[1] > 0 && next[1] < i && d - days[next[1] - 1] > 30 {
+                next[1] += 1;
+            }
+            let mut min = mins[i - 1] + costs[0];
+            if next[0] == 0 {
+                min = min.min(costs[1]);
+            } else if d - days[next[0] - 1] <= 7 {
+                min = min.min(mins[next[0] - 1] + costs[1]);
+            }
+            if next[1] == 0 {
+                min = min.min(costs[2]);
+            } else if d - days[next[1] - 1] <= 30 {
+                min = min.min(mins[next[1] - 1] + costs[2]);
+            }
+            mins.push(min);
+        }
+        *mins.last().unwrap()
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    use test_case::test_case;
+
+    #[test_case(vec![1,4,6,7,8,20],vec![2,7,15] => 11; "example 1")]
+    #[test_case(vec![1,2,3,4,5,6,7,8,9,10,30,31], vec![2,7,15] => 17; "example 2")]
+    #[test_case(vec![1,4,6], vec![1,4,20] => 3; "case 1")]
+    #[test_case(vec![1,3,6], vec![1,4,20] => 3; "case 2")]
+    #[test_case(vec![3,4,6,7,8,30], vec![2,7,15] => 9; "case 3")]
+    #[test_case(vec![4,5,9,11,14,16,17,19,21,22,24], vec![1,4,18] => 10; "case 4")]
+    fn test_solution(days: Vec<i32>, costs: Vec<i32>) -> i32 {
+        Solution::mincost_tickets(days, costs)
+    }
+}

src/leetcode/mod.rs

@@ -79,6 +79,7 @@ pub mod algorithm_953;
 pub mod algorithm_958;
 pub mod algorithm_977;
 pub mod algorithm_98;
+pub mod algorithm_983;
 pub mod algorithm_986;
 pub mod algorithm_989;
 pub mod bitwise_and_of_numbers_range_201;