-
Notifications
You must be signed in to change notification settings - Fork 215
/
Medium_095_Unique_Binary_Search_Trees_II_Test.swift
106 lines (104 loc) · 4.14 KB
/
Medium_095_Unique_Binary_Search_Trees_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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
//
// Medium_095_Unique_Binary_Search_Trees_II_Test.swift
// Solutions
//
// Created by Di Wu on 11/20/15.
// Copyright © 2015 diwu. All rights reserved.
//
import XCTest
class Medium_095_Unique_Binary_Search_Trees_II_Test: XCTestCase, SolutionsTestCase {
private typealias Node_Swift = Medium_095_Unique_Binary_Search_Trees_II.Node
private typealias Node_ObjC = ObjC_Medium_095_Unique_Binary_Search_Trees_II_Node
private func convertTreeToArray_swift(_ root: Node_Swift?) -> [Int] {
var ret: [Int] = []
if root == nil {
return ret
} else {
var fifoQueue: [Node_Swift?] = []
fifoQueue.append(root!)
while fifoQueue.count > 0 {
let curr: Node_Swift? = fifoQueue.removeFirst()
if curr == nil {
ret.append(Int.min)
} else {
ret.append((curr?.value)!)
fifoQueue.append(curr?.left)
fifoQueue.append(curr?.right)
}
}
return ret
}
}
private func convertTreeToArray_objc(_ root: Node_ObjC?) -> [Int] {
var ret: [Int] = []
if root == nil || root!.isKind(of: Node_ObjC.self) == false {
return ret
} else {
var fifoQueue: [Node_ObjC?] = []
fifoQueue.append(root)
while fifoQueue.count > 0 {
let curr: Node_ObjC? = fifoQueue.removeFirst()
if curr == nil {
ret.append(Int.min)
} else {
ret.append((curr?.value)!)
fifoQueue.append(curr?.left)
fifoQueue.append(curr?.right)
}
}
return ret
}
}
func test_001() {
let input: Int = 1
let expected: NSSet = NSSet(array: [
[1, Int.min, Int.min]
])
asyncHelper(input: input, expected: expected)
}
func test_002() {
let input: Int = 2
let expected: NSSet = NSSet(array: [
[2, 1, Int.min, Int.min, Int.min],
[1, Int.min, 2, Int.min, Int.min],
])
asyncHelper(input: input, expected: expected)
}
func test_003() {
let input: Int = 3
let expected: NSSet = NSSet(array: [
[1, Int.min, 3, 2, Int.min, Int.min, Int.min],
[3, 2, Int.min, 1, Int.min, Int.min, Int.min],
[3, 1, Int.min, Int.min, 2, Int.min, Int.min],
[2, 1, 3, Int.min, Int.min, Int.min, Int.min],
[1, Int.min, 2, Int.min, 3, Int.min, Int.min],
])
asyncHelper(input: input, expected: expected)
}
private func asyncHelper(input: Int, expected: NSSet) {
weak var expectation: XCTestExpectation? = self.expectation(description:timeOutName())
serialQueue().async(execute: { () -> Void in
let result_swift: [Node_Swift?] = Medium_095_Unique_Binary_Search_Trees_II.generateTrees(input)
let result_objc: [Any] = ObjC_Medium_095_Unique_Binary_Search_Trees_II.generateTrees(input)
var int_arr_swift: [[Int]] = []
var int_arr_objc: [[Int]] = []
for node in result_swift {
int_arr_swift.append(self.convertTreeToArray_swift(node))
}
for n in result_objc {
let node = n as! Node_ObjC
int_arr_objc.append(self.convertTreeToArray_objc(node))
}
assertHelper(expected == NSSet(array: int_arr_swift), problemName:self.problemName(), input: input, resultValue: int_arr_swift, expectedValue: expected)
assertHelper(expected == NSSet(array: int_arr_objc), problemName:self.problemName(), input: input, resultValue: int_arr_objc, expectedValue: expected)
if let unwrapped = expectation {
unwrapped.fulfill()
}
})
waitForExpectations(timeout:timeOut()) { (error: Error?) -> Void in
if error != nil {
assertHelper(false, problemName:self.problemName(), input: input, resultValue:self.timeOutName(), expectedValue: expected)
}
}
}
}