-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathSolution.swift
35 lines (31 loc) · 965 Bytes
/
Solution.swift
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
//
// Solution.swift
// LeetCode
//
// Created by Nihad on 11/20/21.
//
import Foundation
class Solution {
func permute(_ nums: [Int]) -> [[Int]] {
var result: [[Int]] = []
var partialResult: [Int] = []
var isVisited: [Bool] = Array<Bool>(repeating: false, count: nums.count)
permute(nums, &result, &partialResult, &isVisited)
return result
}
private func permute(_ nums: [Int], _ result: inout [[Int]], _ partialResult: inout [Int], _ isVisited: inout [Bool]) {
if partialResult.count == nums.count {
result.append(partialResult)
return
}
for i in 0..<nums.count {
if !isVisited[i] {
partialResult.append(nums[i])
isVisited[i] = true
permute(nums, &result, &partialResult, &isVisited)
isVisited[i] = false
partialResult.removeLast()
}
}
}
}