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

添加39. 组合总和JavaScript版本

Browse Source
This commit is contained in:
qingyi.liu
2021-06-05 18:42:38 +08:00
parent 7cbf0b1fff
commit d6955ebf03
1 changed files with 22 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
problems/0039.组合总和.md
View File

@ -286,30 +286,30 @@ class Solution:
``` ```
Go： Go：
JavaScript JavaScript：
```js ```js
var strStr = function (haystack, needle) { var combinationSum = function(candidates, target) {
if (needle === '') { const res = [], path = [];
return 0; candidates.sort(); // 排序
} backtracking(0, 0);
return res;
let hayslen = haystack.length; function backtracking(j, sum) {
let needlen = needle.length; if (sum > target) return;
if (sum === target) {
if (haystack === '' || hayslen < needlen) { res.push(Array.from(path));
return -1; return;
} }
for(let i = j; i < candidates.length; i++ ) {
for (let i = 0; i <= hayslen - needlen; i++) { const n = candidates[i];
if (haystack[i] === needle[0]) { if(n > target - sum) continue;
if (haystack.substr(i, needlen) === needle) { path.push(n);
return i; sum += n;
} backtracking(i, sum);
path.pop();
sum -= n;
}
} }
if (i === hayslen - needlen) {
return -1;
}
}
}; };
``` ```