algorithm/Algorithm/String/main.swift at master · gl-lei/algorithm · GitHub

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
//
//  main.swift
//  String
//
//  Created by ggl on 2020/6/25.
//  Copyright © 2020 ggl. All rights reserved.
//

import Foundation

print("============字符串匹配BF算法==============")
let subString = "abc"
let mainString = "baddeabcf"
if let result = bfSearch(subString: subString, mainString: mainString) {
    print("BF: found \"\(subString)\" in \"\(mainString)\" at index: \(result).")
} else {
    print("BF: not found \"\(subString)\" in \"\(mainString)\".")
}

print("\n============字符串匹配RK算法==============")
if let result = rkSearch(subString: subString, mainString: mainString) {
    print("RK: found \"\(subString)\" in \"\(mainString)\" at index: \(result).")
} else {
    print("RK: not found \"\(subString)\" in \"\(mainString)\".")
}

print("\n============字符串匹配BM算法==============")
if let result = bmSearch(subString: subString, mainString: mainString) {
    print("BM: found \"\(subString)\" in \"\(mainString)\" at index: \(result).")
} else {
    print("BM: not found \"\(subString)\" in \"\(mainString)\".")
}

print("\n============字符串匹配KMP算法==============")
if let result = kmpSearch(subString: subString, mainString: mainString) {
    print("KMP: found \"\(subString)\" in \"\(mainString)\" at index: \(result).")
} else {
    print("KMP: not found \"\(subString)\" in \"\(mainString)\".")
}

print("\n============Trie树==============")
var trie = Trie()
trie.insert(data: "hello")
trie.insert(data: "her")
trie.insert(data: "hi")
trie.insert(data: "how")
trie.insert(data: "so")
trie.insert(data: "see")
trie.insert(data: "sow")
trie.print()

let findString = "so"
print("\n============查找\(findString)是否存在trie树中存在==============")
let result = trie.find(data: findString)
if result {
    print("\(findString)在trie树中存在")
} else {
    print("\(findString)在trie树中不存在")
}