algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #634 from youngqqcn/fix_0494_bug

Browse Source 
Fix 0494 bug
This commit is contained in:
程序员Carl
2021-08-23 10:06:17 +08:00
committed by GitHub
parent 301026babd 1f5144f22c
commit f0d4295503
3 changed files with 17 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0035.搜索插入位置.md
View File

@ -76,7 +76,7 @@ public:
``` ```
时间复杂度：O(n) 时间复杂度：O(n)
时间复杂度：O(1) 空间复杂度：O(1)
效率如下： 效率如下：

3
problems/0070.爬楼梯完全背包版本.md
View File

@ -88,7 +88,8 @@
以上分析完毕，C++代码如下： 以上分析完毕，C++代码如下：
```
```cpp
class Solution { class Solution {
public: public:
int climbStairs(int n) { int climbStairs(int n) {

1
problems/0494.目标和.md
View File

@ -202,6 +202,7 @@ public:
for (int i = 0; i < nums.size(); i++) sum += nums[i]; for (int i = 0; i < nums.size(); i++) sum += nums[i];
if (S > sum) return 0; // 此时没有方案 if (S > sum) return 0; // 此时没有方案
if ((S + sum) % 2 == 1) return 0; // 此时没有方案 if ((S + sum) % 2 == 1) return 0; // 此时没有方案
if (S + sum < 0) return 0; // 以确保bagSize为正数
int bagSize = (S + sum) / 2; int bagSize = (S + sum) / 2;
vector<int> dp(bagSize + 1, 0); vector<int> dp(bagSize + 1, 0);
dp[0] = 1; dp[0] = 1;