mirror of
https://github.com/krahets/hello-algo.git
synced 2025-02-02 22:43:50 +08:00
Fix JS and TS sort bugs (#784)
This commit is contained in:
parent
1067f30fe7
commit
2f727d895d
@ -31,7 +31,7 @@ function backtrack(state, target, choices, start, res) {
|
||||
/* 求解子集和 I */
|
||||
function subsetSumI(nums, target) {
|
||||
const state = []; // 状态(子集)
|
||||
nums.sort(); // 对 nums 进行排序
|
||||
nums.sort((a, b) => a - b); // 对 nums 进行排序
|
||||
const start = 0; // 遍历起始点
|
||||
const res = []; // 结果列表(子集列表)
|
||||
backtrack(state, target, nums, start, res);
|
||||
|
@ -36,7 +36,7 @@ function backtrack(state, target, choices, start, res) {
|
||||
/* 求解子集和 II */
|
||||
function subsetSumII(nums, target) {
|
||||
const state = []; // 状态(子集)
|
||||
nums.sort(); // 对 nums 进行排序
|
||||
nums.sort((a, b) => a - b); // 对 nums 进行排序
|
||||
const start = 0; // 遍历起始点
|
||||
const res = []; // 结果列表(子集列表)
|
||||
backtrack(state, target, nums, start, res);
|
||||
|
@ -37,7 +37,7 @@ function backtrack(
|
||||
/* 求解子集和 I */
|
||||
function subsetSumI(nums: number[], target: number): number[][] {
|
||||
const state = []; // 状态(子集)
|
||||
nums.sort(); // 对 nums 进行排序
|
||||
nums.sort((a, b) => a - b); // 对 nums 进行排序
|
||||
const start = 0; // 遍历起始点
|
||||
const res = []; // 结果列表(子集列表)
|
||||
backtrack(state, target, nums, start, res);
|
||||
|
@ -42,7 +42,7 @@ function backtrack(
|
||||
/* 求解子集和 II */
|
||||
function subsetSumII(nums: number[], target: number): number[][] {
|
||||
const state = []; // 状态(子集)
|
||||
nums.sort(); // 对 nums 进行排序
|
||||
nums.sort((a, b) => a - b); // 对 nums 进行排序
|
||||
const start = 0; // 遍历起始点
|
||||
const res = []; // 结果列表(子集列表)
|
||||
backtrack(state, target, nums, start, res);
|
||||
|
Loading…
Reference in New Issue
Block a user