mirror of
https://github.com/krahets/hello-algo.git
synced 2026-04-13 12:49:51 +08:00
* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
59 lines
2.1 KiB
Swift
59 lines
2.1 KiB
Swift
/**
|
|
* File: subset_sum_ii.swift
|
|
* Created Time: 2023-07-02
|
|
* Author: nuomi1 (nuomi1@qq.com)
|
|
*/
|
|
|
|
/* Backtracking algorithm: Subset sum II */
|
|
func backtrack(state: inout [Int], target: Int, choices: [Int], start: Int, res: inout [[Int]]) {
|
|
// When the subset sum equals target, record the solution
|
|
if target == 0 {
|
|
res.append(state)
|
|
return
|
|
}
|
|
// Traverse all choices
|
|
// Pruning 2: start traversing from start to avoid generating duplicate subsets
|
|
// Pruning 3: start traversing from start to avoid repeatedly selecting the same element
|
|
for i in choices.indices.dropFirst(start) {
|
|
// Pruning 1: if the subset sum exceeds target, end the loop directly
|
|
// This is because the array is sorted, and later elements are larger, so the subset sum will definitely exceed target
|
|
if target - choices[i] < 0 {
|
|
break
|
|
}
|
|
// Pruning 4: if this element equals the left element, it means this search branch is duplicate, skip it directly
|
|
if i > start, choices[i] == choices[i - 1] {
|
|
continue
|
|
}
|
|
// Attempt: make choice, update target, start
|
|
state.append(choices[i])
|
|
// Proceed to the next round of selection
|
|
backtrack(state: &state, target: target - choices[i], choices: choices, start: i + 1, res: &res)
|
|
// Backtrack: undo choice, restore to previous state
|
|
state.removeLast()
|
|
}
|
|
}
|
|
|
|
/* Solve subset sum II */
|
|
func subsetSumII(nums: [Int], target: Int) -> [[Int]] {
|
|
var state: [Int] = [] // State (subset)
|
|
let nums = nums.sorted() // Sort nums
|
|
let start = 0 // Start point for traversal
|
|
var res: [[Int]] = [] // Result list (subset list)
|
|
backtrack(state: &state, target: target, choices: nums, start: start, res: &res)
|
|
return res
|
|
}
|
|
|
|
@main
|
|
enum SubsetSumII {
|
|
/* Driver Code */
|
|
static func main() {
|
|
let nums = [4, 4, 5]
|
|
let target = 9
|
|
|
|
let res = subsetSumII(nums: nums, target: target)
|
|
|
|
print("Input array nums = \(nums), target = \(target)")
|
|
print("All subsets with sum equal to \(target) res = \(res)")
|
|
}
|
|
}
|