Merge branch 'master' into dp05

problems/1049.最后一块石头的重量II.md

@@ -7,7 +7,7 @@
 
 ## 1049. 最后一块石头的重量 II
 
-[力扣题目链接](https://leetcode-cn.com/problems/last-stone-weight-ii/)
+[力扣题目链接](https://leetcode.cn/problems/last-stone-weight-ii/)
 
 题目难度：中等
 
@@ -277,22 +277,52 @@ var lastStoneWeightII = function (stones) {
 };
 ```
 
+### C
+```c
+#define MAX(a, b) (((a) > (b)) ? (a) : (b))
+
+int getSum(int *stones, int stoneSize) {
+    int sum = 0, i;
+    for (i = 0; i < stoneSize; ++i)
+        sum += stones[i];
+    return sum;
+}
+
+int lastStoneWeightII(int* stones, int stonesSize){
+    int sum = getSum(stones, stonesSize);
+    int target = sum / 2;
+    int i, j;
+
+    // 初始化dp数组
+    int *dp = (int*)malloc(sizeof(int) * (target + 1));
+    memset(dp, 0, sizeof(int) * (target + 1));
+    for (j = stones[0]; j <= target; ++j)
+        dp[j] = stones[0];
+    
+    // 递推公式：dp[j] = max(dp[j], dp[j - stones[i]] + stones[i])
+    for (i = 1; i < stonesSize; ++i) {
+        for (j = target; j >= stones[i]; --j)
+            dp[j] = MAX(dp[j], dp[j - stones[i]] + stones[i]);
+    }
+    return sum - dp[target] - dp[target];
+}
+```
+
 ### TypeScript：
 
-```typescript
+```ts
 function lastStoneWeightII(stones: number[]): number {
-    const sum: number = stones.reduce((pre, cur) => pre + cur);
-    const bagSize: number = Math.floor(sum / 2);
-    const weightArr: number[] = stones;
-    const valueArr: number[] = stones;
-    const goodsNum: number = weightArr.length;
-    const dp: number[] = new Array(bagSize + 1).fill(0);
-    for (let i = 0; i < goodsNum; i++) {
-        for (let j = bagSize; j >= weightArr[i]; j--) {
-            dp[j] = Math.max(dp[j], dp[j - weightArr[i]] + valueArr[i]);
+    const sum: number = stones.reduce((a: number, b:number): number => a + b);
+    const target: number = Math.floor(sum / 2);
+    const n: number = stones.length;
+    // dp[j]表示容量（总数和）为j的背包所能装下的数（下标[0, i]之间任意取）的总和（<= 容量）的最大值
+    const dp: number[] = new Array(target + 1).fill(0);
+    for (let i: number = 0; i < n; i++ ) {
+        for (let j: number = target; j >= stones[i]; j--) {
+            dp[j] = Math.max(dp[j], dp[j - stones[i]] + stones[i]);
         }
     }
-    return sum - dp[bagSize] * 2;
+    return sum - dp[target] - dp[target];
 };
 ```
 
@@ -338,5 +368,8 @@ object Solution {
 }
 ```
 
+
+
+
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>