update 395

Author: geemaple

README.md

@@ -40,10 +40,10 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [✅] | [9c-dp.md](./list/9c-dp.md) | 42/45 | 3 vips |
 | [✅] | [geekbang.md](./list/geekbang.md) | 55/55 | - |
 | [✅] | [leetcode101.md](./list/leetcode101.md) | 183/184 | 1 vip |
-| [🔲] | [9c-advanced.md](./list/9c-advanced.md) | 49/94 | 10 vips |
+| [🔲] | [9c-advanced.md](./list/9c-advanced.md) | 53/93 | 11 vips |
 | [🔲] | [leetcode-contest.md](./list/leetcode-contest.md) | 10/40 | - |
 
-**Solved**: 438 problems
+**Solved**: 439 problems
 
 ## 类型/Category
 
@@ -279,11 +279,12 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 
 ## Game Theory
 
-| Link | Problem(3) | Solution | Tag | Time | Space | Ref |
+| Link | Problem(4) | Solution | Tag | Time | Space | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- | ----- |
 | [Leetcode-375](https://leetcode.com/problems/guess-number-higher-or-lower-ii/) | Guess Number Higher Or Lower II | [c++](./leetcode/375.guess-number-higher-or-lower-ii.cpp), [python3](./leetcode/375.guess-number-higher-or-lower-ii.py) | Game Theory | O\(N^3\) | O\(N^2\) | - |
 | [Leetcode-3283](https://leetcode.com/problems/maximum-number-of-moves-to-kill-all-pawns/) | Maximum Number Of Moves To Kill All Pawns | [c++](./leetcode/3283.maximum-number-of-moves-to-kill-all-pawns.cpp), [python3](./leetcode/3283.maximum-number-of-moves-to-kill-all-pawns.py) | Game Theory | O\(2^K \* K\) | O\(2^K \* K\) | - |
 | [Lintcode-394](https://www.lintcode.com/problem/coins-in-a-line/) | Coins In A Line | [c++](./lintcode/394.coins-in-a-line.cpp), [python3](./lintcode/394.coins-in-a-line.py) | Game Theory | O\(N\) | O\(N\) | - |
+| [Lintcode-395](https://www.lintcode.com/problem/coins-in-a-line-ii/) | Coins In A Line II | [c++](./lintcode/395.coins-in-a-line-ii.cpp), [python3](./lintcode/395.coins-in-a-line-ii.py) | Game Theory | O\(N\) | O\(N\) | - |
 
 ## Binary Search
 

lintcode/395.coins-in-a-line-ii.cpp

@@ -0,0 +1,54 @@
+//  Tag: Dynamic Programming/DP, Game Theory, Game DP
+//  Time: O(N)
+//  Space: O(N)
+//  Ref: -
+//  Note: -
+
+//  There are n coins with different value in a line.
+//  Two players take turns to take one or two coins from **left side** until there are no more coins left.
+//  The player who take the coins with the most value wins.
+//  
+//  Could you please decide the **first** player will win or lose?
+//  
+//  If the first player wins, return `true`, otherwise return `false`.
+//  
+//  **Example 1:**
+//  
+//  ```
+//  Input: [1, 2, 2]
+//  Output: true
+//  Explanation: The first player takes 2 coins.
+//  ```
+//  
+//  **Example 2:**
+//  
+//  ```
+//  Input: [1, 2, 4]
+//  Output: false
+//  Explanation: Whether the first player takes 1 coin or 2, the second player will gain more value.
+//  ```
+//  
+//  
+
+class Solution {
+public:
+    /**
+     * @param values: a vector of integers
+     * @return: a boolean which equals to true if the first player will win
+     */
+    bool firstWillWin(vector<int> &values) {
+        // write your code here
+        int n = values.size();
+        vector<int> dp(n + 1, 0);
+        dp[n - 1] = values[n - 1];
+        for (int i = n - 2; i >= 0; i--) {
+            int v = values[i];
+            dp[i] = max(dp[i], v - dp[i + 1]);
+
+            v = values[i] + values[i + 1];
+            dp[i] = max(dp[i], v - dp[i + 2]);
+        }
+
+        return dp[0] > 0;
+    }
+};

lintcode/395.coins-in-a-line-ii.py

@@ -0,0 +1,55 @@
+#  Tag: Dynamic Programming/DP, Game Theory, Game DP
+#  Time: O(N)
+#  Space: O(N)
+#  Ref: -
+#  Note: -
+
+#  There are n coins with different value in a line.
+#  Two players take turns to take one or two coins from **left side** until there are no more coins left.
+#  The player who take the coins with the most value wins.
+#  
+#  Could you please decide the **first** player will win or lose?
+#  
+#  If the first player wins, return `true`, otherwise return `false`.
+#  
+#  **Example 1:**
+#  
+#  ```
+#  Input: [1, 2, 2]
+#  Output: true
+#  Explanation: The first player takes 2 coins.
+#  ```
+#  
+#  **Example 2:**
+#  
+#  ```
+#  Input: [1, 2, 4]
+#  Output: false
+#  Explanation: Whether the first player takes 1 coin or 2, the second player will gain more value.
+#  ```
+#  
+#  
+
+from typing import (
+    List,
+)
+
+class Solution:
+    """
+    @param values: a vector of integers
+    @return: a boolean which equals to true if the first player will win
+    """
+    def first_will_win(self, values: List[int]) -> bool:
+        # write your code here
+        n = len(values)
+        dp = [0 for i in range(n + 1)]
+        dp[n - 1] = values[n - 1]
+
+        for i in range(n - 2, -1, -1):
+            v = values[i]
+            dp[i] = max(dp[i], v - dp[i + 1])
+
+            v = values[i] + values[i + 1]
+            dp[i] = max(dp[i], v - dp[i + 2])
+
+        return dp[0] > 0

list/9c-advanced.md

@@ -74,13 +74,11 @@
 58. https://www.lintcode.com/problem/maximal-square-ii/
 59. https://leetcode.com/problems/unique-paths/
 60. https://leetcode.com/problems/minimum-path-sum/
-
-- https://www.lintcode.com/problem/edit-distance/
-- https://www.lintcode.com/problem/longest-continuous-increasing-subsequence/
-- https://www.lintcode.com/problem/longest-continuous-increasing-subsequence-ii/
-- https://www.lintcode.com/problem/coins-in-a-line/
-- https://www.lintcode.com/problem/coins-in-a-line-ii/
-- https://www.lintcode.com/problem/coins-in-a-line-iii/
+61. https://leetcode.com/problems/edit-distance/
+62. https://leetcode.com/problems/longest-continuous-increasing-subsequence/
+63. https://www.lintcode.com/problem/coins-in-a-line/
+64. https://www.lintcode.com/problem/coins-in-a-line-ii/
+65. https://www.lintcode.com/problem/coins-in-a-line-iii/
 
 - https://www.lintcode.com/problem/stone-game/
 - https://www.lintcode.com/problem/burst-balloons/