hello-algo/zh-hant/codes/kotlin/chapter_backtracking/permutations_ii.kt
Yudong Jin b2f0d4603d
Many bug fixes and improvements (#1270)
* Add Ruby and Kotlin icons
Add the avatar of @curtishd

* Update README

* Synchronize zh-hant and zh versions.

* Translate the pythontutor blocks to traditional Chinese

* Fix en/mkdocs.yml

* Update the landing page of the en version.

* Fix the Dockerfile

* Refine the en landingpage

* Fix en landing page

* Reset the README.md
2024-04-11 20:18:19 +08:00

54 lines
No EOL
1.6 KiB
Kotlin

/**
* File: permutations_ii.kt
* Created Time: 2024-01-25
* Author: curtishd (1023632660@qq.com)
*/
package chapter_backtracking.permutations_ii
/* 回溯演算法:全排列 II */
fun backtrack(
state: MutableList<Int>,
choices: IntArray,
selected: BooleanArray,
res: MutableList<MutableList<Int>?>
) {
// 當狀態長度等於元素數量時,記錄解
if (state.size == choices.size) {
res.add(state.toMutableList())
return
}
// 走訪所有選擇
val duplicated = HashSet<Int>()
for (i in choices.indices) {
val choice = choices[i]
// 剪枝:不允許重複選擇元素 且 不允許重複選擇相等元素
if (!selected[i] && !duplicated.contains(choice)) {
// 嘗試:做出選擇,更新狀態
duplicated.add(choice) // 記錄選擇過的元素值
selected[i] = true
state.add(choice)
// 進行下一輪選擇
backtrack(state, choices, selected, res)
// 回退:撤銷選擇,恢復到之前的狀態
selected[i] = false
state.removeAt(state.size - 1)
}
}
}
/* 全排列 II */
fun permutationsII(nums: IntArray): MutableList<MutableList<Int>?> {
val res = mutableListOf<MutableList<Int>?>()
backtrack(mutableListOf(), nums, BooleanArray(nums.size), res)
return res
}
/* Driver Code */
fun main() {
val nums = intArrayOf(1, 2, 2)
val res = permutationsII(nums)
println("輸入陣列 nums = ${nums.contentToString()}")
println("所有排列 res = $res")
}