refactor: use Package.swift to define executable task

This commit is contained in:
nuomi1 2023-01-02 21:48:32 +08:00
parent 6e8954672f
commit 377200a39a
No known key found for this signature in database
GPG key ID: E410D5FF602FBF25
7 changed files with 169 additions and 131 deletions

18
codes/swift/Package.swift Normal file
View file

@ -0,0 +1,18 @@
// swift-tools-version: 5.7
import PackageDescription
let package = Package(
name: "HelloAlgo",
products: [
.executable(name: "time_complexity", targets: ["time_complexity"]),
.executable(name: "worst_best_time_complexity", targets: ["worst_best_time_complexity"]),
.executable(name: "space_complexity", targets: ["space_complexity"]),
],
targets: [
.target(name: "utils", path: "utils"),
.executableTarget(name: "time_complexity", path: "chapter_computational_complexity", sources: ["time_complexity.swift"]),
.executableTarget(name: "worst_best_time_complexity", path: "chapter_computational_complexity", sources: ["worst_best_time_complexity.swift"]),
.executableTarget(name: "space_complexity", dependencies: ["utils"], path: "chapter_computational_complexity", sources: ["space_complexity.swift"]),
]
)

View file

@ -4,82 +4,7 @@
* Author: nuomi1 (nuomi1@qq.com) * Author: nuomi1 (nuomi1@qq.com)
*/ */
class ListNode { import utils
var val: Int
var next: ListNode?
init(x: Int) {
val = x
}
}
class TreeNode {
var val: Int //
var height: Int //
var left: TreeNode? //
var right: TreeNode? //
init(x: Int) {
val = x
height = 0
}
}
enum PrintUtil {
private class Trunk {
var prev: Trunk?
var str: String
init(prev: Trunk?, str: String) {
self.prev = prev
self.str = str
}
}
static func printTree(root: TreeNode?) {
printTree(root: root, prev: nil, isLeft: false)
}
private static func printTree(root: TreeNode?, prev: Trunk?, isLeft: Bool) {
if root == nil {
return
}
var prevStr = " "
let trunk = Trunk(prev: prev, str: prevStr)
printTree(root: root?.right, prev: trunk, isLeft: true)
if prev == nil {
trunk.str = "———"
} else if isLeft {
trunk.str = "/———"
prevStr = " |"
} else {
trunk.str = "\\———"
prev?.str = prevStr
}
showTrunks(p: trunk)
print(" \(root!.val)")
if prev != nil {
prev?.str = prevStr
}
trunk.str = " |"
printTree(root: root?.left, prev: trunk, isLeft: false)
}
private static func showTrunks(p: Trunk?) {
if p == nil {
return
}
showTrunks(p: p?.prev)
print(p!.str, terminator: "")
}
}
// //
@discardableResult @discardableResult
@ -153,20 +78,21 @@ func buildTree(n: Int) -> TreeNode? {
return root return root
} }
// Driver Code @main
func main() { enum SpaceComplexity {
let n = 5 // Driver Code
// static func main() {
constant(n: n) let n = 5
// 线 //
linear(n: n) constant(n: n)
linearRecur(n: n) // 线
// linear(n: n)
quadratic(n: n) linearRecur(n: n)
quadraticRecur(n: n) //
// quadratic(n: n)
let root = buildTree(n: n) quadraticRecur(n: n)
PrintUtil.printTree(root: root) //
let root = buildTree(n: n)
PrintUtil.printTree(root: root)
}
} }
main()

View file

@ -131,40 +131,41 @@ func factorialRecur(n: Int) -> Int {
return count return count
} }
func main() { @main
// n enum TimeComplexity {
let n = 8 static func main() {
print("输入数据大小 n =", n) // n
let n = 8
print("输入数据大小 n =", n)
var count = constant(n: n) var count = constant(n: n)
print("常数阶的计算操作数量 =", count) print("常数阶的计算操作数量 =", count)
count = linear(n: n) count = linear(n: n)
print("线性阶的计算操作数量 =", count) print("线性阶的计算操作数量 =", count)
count = arrayTraversal(nums: Array(repeating: 0, count: n)) count = arrayTraversal(nums: Array(repeating: 0, count: n))
print("线性阶(遍历数组)的计算操作数量 =", count) print("线性阶(遍历数组)的计算操作数量 =", count)
count = quadratic(n: n) count = quadratic(n: n)
print("平方阶的计算操作数量 =", count) print("平方阶的计算操作数量 =", count)
var nums = Array(sequence(first: n, next: { $0 > 0 ? $0 - 1 : nil })) // [n,n-1,...,2,1] var nums = Array(sequence(first: n, next: { $0 > 0 ? $0 - 1 : nil })) // [n,n-1,...,2,1]
count = bubbleSort(nums: &nums) count = bubbleSort(nums: &nums)
print("平方阶(冒泡排序)的计算操作数量 =", count) print("平方阶(冒泡排序)的计算操作数量 =", count)
count = exponential(n: n) count = exponential(n: n)
print("指数阶(循环实现)的计算操作数量 =", count) print("指数阶(循环实现)的计算操作数量 =", count)
count = expRecur(n: n) count = expRecur(n: n)
print("指数阶(递归实现)的计算操作数量 =", count) print("指数阶(递归实现)的计算操作数量 =", count)
count = logarithmic(n: n) count = logarithmic(n: n)
print("对数阶(循环实现)的计算操作数量 =", count) print("对数阶(循环实现)的计算操作数量 =", count)
count = logRecur(n: n) count = logRecur(n: n)
print("对数阶(递归实现)的计算操作数量 =", count) print("对数阶(递归实现)的计算操作数量 =", count)
count = linearLogRecur(n: Double(n)) count = linearLogRecur(n: Double(n))
print("线性对数阶(递归实现)的计算操作数量 =", count) print("线性对数阶(递归实现)的计算操作数量 =", count)
count = factorialRecur(n: n) count = factorialRecur(n: n)
print("阶乘阶(递归实现)的计算操作数量 =", count) print("阶乘阶(递归实现)的计算操作数量 =", count)
}
} }
main()

View file

@ -23,15 +23,16 @@ func findOne(nums: [Int]) -> Int {
return -1 return -1
} }
// Driver Code @main
func main() { enum WorstBestTimeComplexity {
for _ in 0 ..< 10 { // Driver Code
let n = 100 static func main() {
let nums = randomNumbers(n: n) for _ in 0 ..< 10 {
let index = findOne(nums: nums) let n = 100
print("数组 [ 1, 2, ..., n ] 被打乱后 =", nums) let nums = randomNumbers(n: n)
print("数字 1 的索引为", index) let index = findOne(nums: nums)
print("数组 [ 1, 2, ..., n ] 被打乱后 =", nums)
print("数字 1 的索引为", index)
}
} }
} }
main()

View file

@ -0,0 +1,14 @@
/*
* File: ListNode.swift
* Created Time: 2023-01-02
* Author: nuomi1 (nuomi1@qq.com)
*/
public class ListNode {
public var val: Int //
public var next: ListNode? //
public init(x: Int) {
val = x
}
}

View file

@ -0,0 +1,61 @@
/*
* File: PrintUtil.swift
* Created Time: 2023-01-02
* Author: nuomi1 (nuomi1@qq.com)
*/
public enum PrintUtil {
private class Trunk {
var prev: Trunk?
var str: String
init(prev: Trunk?, str: String) {
self.prev = prev
self.str = str
}
}
public static func printTree(root: TreeNode?) {
printTree(root: root, prev: nil, isLeft: false)
}
private static func printTree(root: TreeNode?, prev: Trunk?, isLeft: Bool) {
if root == nil {
return
}
var prevStr = " "
let trunk = Trunk(prev: prev, str: prevStr)
printTree(root: root?.right, prev: trunk, isLeft: true)
if prev == nil {
trunk.str = "———"
} else if isLeft {
trunk.str = "/———"
prevStr = " |"
} else {
trunk.str = "\\———"
prev?.str = prevStr
}
showTrunks(p: trunk)
print(" \(root!.val)")
if prev != nil {
prev?.str = prevStr
}
trunk.str = " |"
printTree(root: root?.left, prev: trunk, isLeft: false)
}
private static func showTrunks(p: Trunk?) {
if p == nil {
return
}
showTrunks(p: p?.prev)
print(p!.str, terminator: "")
}
}

View file

@ -0,0 +1,17 @@
/*
* File: TreeNode.swift
* Created Time: 2023-01-02
* Author: nuomi1 (nuomi1@qq.com)
*/
public class TreeNode {
public var val: Int //
public var height: Int //
public var left: TreeNode? //
public var right: TreeNode? //
public init(x: Int) {
val = x
height = 0
}
}