Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Fix JS and TS sort bugs for subset_sum #784

Merged
merged 1 commit into from
Sep 23, 2023
Merged

Fix JS and TS sort bugs for subset_sum #784

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion codes/javascript/chapter_backtracking/subset_sum_i.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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);
Expand Down
2 changes: 1 addition & 1 deletion codes/javascript/chapter_backtracking/subset_sum_ii.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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);
Expand Down
4 changes: 2 additions & 2 deletions codes/typescript/chapter_backtracking/subset_sum_i.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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);
Expand All @@ -51,4 +51,4 @@ const res = subsetSumI(nums, target);
console.log(`输入数组 nums = ${JSON.stringify(nums)}, target = ${target}`);
console.log(`所有和等于 ${target} 的子集 res = ${JSON.stringify(res)}`);

export {};
export { };
4 changes: 2 additions & 2 deletions codes/typescript/chapter_backtracking/subset_sum_ii.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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);
Expand All @@ -56,4 +56,4 @@ const res = subsetSumII(nums, target);
console.log(`输入数组 nums = ${JSON.stringify(nums)}, target = ${target}`);
console.log(`所有和等于 ${target} 的子集 res = ${JSON.stringify(res)}`);

export {};
export { };