forked from diwu/LeetCode-Solutions-in-Swift
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathHard_047_Permutations_II_Test.swift
65 lines (63 loc) · 2.99 KB
/
Hard_047_Permutations_II_Test.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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
//
// Hard_047_Permutations_II_Test.swift
// Solutions
//
// Created by Di Wu on 5/23/15.
// Copyright (c) 2015 diwu. All rights reserved.
//
import XCTest
class Hard_047_Permutations_II_Test: XCTestCase {
private static let ProblemName: String = "Hard_047_Permutations_II"
private static let TimeOutName = ProblemName + Default_Timeout_Suffix
private static let TimeOut = Default_Timeout_Value * 10
func test_001() {
let input: [Int] = [1, 2, 3]
let expected: [[Int]] = [[1, 2, 3], [2, 1, 3], [1, 3, 2], [2, 3, 1], [3, 1, 2], [3, 2, 1]]
asyncHelper(input: input, expected: expected)
}
func test_002() {
let input: [Int] = [1, 2, 3, 4]
let expected: [[Int]] = [[4, 3, 2, 1], [1, 2, 3, 4], [1, 2, 4, 3], [1, 3, 2, 4], [1, 3, 4, 2], [2, 1, 3, 4], [2, 1, 4, 3], [2, 3, 1, 4], [2, 3, 4, 1], [3, 1, 2, 4], [3, 1, 4, 2], [3, 2, 1, 4], [3, 2, 4, 1], [3, 4, 1, 2], [3, 4, 2, 1], [1, 4, 2, 3], [1, 4, 3, 2], [2, 4, 1, 3], [2, 4, 3, 1], [4, 1, 2, 3], [4, 1, 3, 2], [4, 2, 1, 3], [4, 2, 3, 1], [4, 3, 1, 2]]
asyncHelper(input: input, expected: expected)
}
func test_003() {
let input: [Int] = [1, 1, 2]
let expected: [[Int]] = [[1, 1, 2], [1, 2, 1], [2, 1, 1]]
asyncHelper(input: input, expected: expected)
}
func test_004() {
let input: [Int] = [1]
let expected: [[Int]] = [[1]]
asyncHelper(input: input, expected: expected)
}
private func asyncHelper(input: [Int], expected: [[Int]]) {
weak var expectation: XCTestExpectation? = self.expectation(description: Hard_047_Permutations_II_Test.TimeOutName)
DispatchQueue.global(qos: DispatchQoS.QoSClass.default).async(execute: { () -> Void in
var result = Hard_047_Permutations_II.permuteUnique(input)
if result.count != expected.count {
assertHelper(false, problemName: Hard_047_Permutations_II_Test.ProblemName, input: input, resultValue: result, expectedValue: expected)
} else {
for i in 0 ..< expected.count {
var flag = false
for j in 0 ..< result.count {
if expected[i] == result[j] {
flag = true
break
}
}
if flag == false {
assertHelper(false, problemName: Hard_047_Permutations_II_Test.ProblemName, input: input, resultValue: result, expectedValue: expected)
}
}
}
if let unwrapped = expectation {
unwrapped.fulfill()
}
})
waitForExpectations(timeout: Hard_047_Permutations_II_Test.TimeOut) { (error: Error?) -> Void in
if error != nil {
assertHelper(false, problemName: Hard_047_Permutations_II_Test.ProblemName, input: input, resultValue: Hard_047_Permutations_II_Test.TimeOutName, expectedValue: expected)
}
}
}
}