From 34444b3a4d7c5fb5eb9d9bc61bc300c47e08a39d Mon Sep 17 00:00:00 2001 From: yqq Date: Sat, 21 Aug 2021 18:00:54 +0800 Subject: [PATCH] fix 0494 --- problems/0494.目标和.md | 19 ++++++++++--------- 1 file changed, 10 insertions(+), 9 deletions(-) diff --git a/problems/0494.目标和.md b/problems/0494.目标和.md index 77b3c76d..5d89f7dc 100644 --- a/problems/0494.目标和.md +++ b/problems/0494.目标和.md @@ -19,15 +19,15 @@ 示例: -输入:nums: [1, 1, 1, 1, 1], S: 3 -输出:5 +输入:nums: [1, 1, 1, 1, 1], S: 3 +输出:5 -解释: --1+1+1+1+1 = 3 -+1-1+1+1+1 = 3 -+1+1-1+1+1 = 3 -+1+1+1-1+1 = 3 -+1+1+1+1-1 = 3 +解释: +-1+1+1+1+1 = 3 ++1-1+1+1+1 = 3 ++1+1-1+1+1 = 3 ++1+1+1-1+1 = 3 ++1+1+1+1-1 = 3 一共有5种方法让最终目标和为3。 @@ -202,6 +202,7 @@ public: for (int i = 0; i < nums.size(); i++) sum += nums[i]; if (S > sum) return 0; // 此时没有方案 if ((S + sum) % 2 == 1) return 0; // 此时没有方案 + if (S + sum < 0) return 0; // 以确保bagSize为正数 int bagSize = (S + sum) / 2; vector dp(bagSize + 1, 0); dp[0] = 1; @@ -311,7 +312,7 @@ Javascript: const findTargetSumWays = (nums, target) => { const sum = nums.reduce((a, b) => a+b); - + if(target > sum) { return 0; }