mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
添加 0047.全排列II.md Scala版本
This commit is contained in:
@ -422,5 +422,43 @@ int** permuteUnique(int* nums, int numsSize, int* returnSize, int** returnColumn
|
||||
}
|
||||
```
|
||||
|
||||
### Scala
|
||||
|
||||
```scala
|
||||
object Solution {
|
||||
import scala.collection.mutable
|
||||
def permuteUnique(nums: Array[Int]): List[List[Int]] = {
|
||||
var result = mutable.ListBuffer[List[Int]]()
|
||||
var path = mutable.ListBuffer[Int]()
|
||||
var num = nums.sorted // 首先对数据进行排序
|
||||
|
||||
def backtracking(used: Array[Boolean]): Unit = {
|
||||
if (path.size == num.size) {
|
||||
// 如果path的size等于num了,那么可以添加到结果集
|
||||
result.append(path.toList)
|
||||
return
|
||||
}
|
||||
// 循环守卫,当前元素没被使用过就进入循环体
|
||||
for (i <- num.indices if used(i) == false) {
|
||||
// 当前索引为0,不存在和前一个数字相等可以进入回溯
|
||||
// 当前索引值和上一个索引不相等,可以回溯
|
||||
// 前一个索引对应的值没有被选,可以回溯
|
||||
// 因为Scala没有continue,只能将逻辑反过来写
|
||||
if (i == 0 || (i > 0 && num(i) != num(i - 1)) || used(i-1) == false) {
|
||||
used(i) = true
|
||||
path.append(num(i))
|
||||
backtracking(used)
|
||||
path.remove(path.size - 1)
|
||||
used(i) = false
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
backtracking(new Array[Boolean](nums.length))
|
||||
result.toList
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
-----------------------
|
||||
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>
|
||||
|
Reference in New Issue
Block a user