Merge branch 'doocs:main' into main

Author: Nothing-avil

images/starcharts.svg

@@ -218,6 +218,51 @@ func dfs(cur *trie, l int) int {
 }
 ```
 
+#### Swift
+
+```swift
+class Trie {
+    var children = [Trie?](repeating: nil, count: 26)
+}
+
+class Solution {
+    func minimumLengthEncoding(_ words: [String]) -> Int {
+        let root = Trie()
+
+        for word in words {
+            var current = root
+            for char in word.reversed() {
+                let index = Int(char.asciiValue! - Character("a").asciiValue!)
+                if current.children[index] == nil {
+                    current.children[index] = Trie()
+                }
+                current = current.children[index]!
+            }
+        }
+
+        return dfs(root, 1)
+    }
+
+    private func dfs(_ current: Trie, _ length: Int) -> Int {
+        var isLeaf = true
+        var result = 0
+
+        for child in current.children {
+            if let child = child {
+                isLeaf = false
+                result += dfs(child, length + 1)
+            }
+        }
+
+        if isLeaf {
+            result += length
+        }
+
+        return result
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof2/剑指 Offer II 065. 最短的单词编码/README.md

@@ -0,0 +1,40 @@
+class Trie {
+    var children = [Trie?](repeating: nil, count: 26)
+}
+
+class Solution {
+    func minimumLengthEncoding(_ words: [String]) -> Int {
+        let root = Trie()
+        
+        for word in words {
+            var current = root
+            for char in word.reversed() {
+                let index = Int(char.asciiValue! - Character("a").asciiValue!)
+                if current.children[index] == nil {
+                    current.children[index] = Trie()
+                }
+                current = current.children[index]!
+            }
+        }
+        
+        return dfs(root, 1)
+    }
+    
+    private func dfs(_ current: Trie, _ length: Int) -> Int {
+        var isLeaf = true
+        var result = 0
+        
+        for child in current.children {
+            if let child = child {
+                isLeaf = false
+                result += dfs(child, length + 1)
+            }
+        }
+        
+        if isLeaf {
+            result += length
+        }
+        
+        return result
+    }
+}

lcof2/剑指 Offer II 065. 最短的单词编码/Solution.swift

@@ -196,6 +196,34 @@ func (this *MapSum) Sum(prefix string) int {
  */
 ```
 
+#### Swift
+
+```swift
+class MapSum {
+    private var data: [String: Int]
+    private var t: [String: Int]
+
+    init() {
+        data = [String: Int]()
+        t = [String: Int]()
+    }
+
+    func insert(_ key: String, _ val: Int) {
+        let old = t[key] ?? 0
+        t[key] = val
+        for i in 1...key.count {
+            let endIndex = key.index(key.startIndex, offsetBy: i)
+            let k = String(key[key.startIndex..<endIndex])
+            data[k, default: 0] += (val - old)
+        }
+    }
+
+    func sum(_ prefix: String) -> Int {
+        return data[prefix] ?? 0
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof2/剑指 Offer II 066. 单词之和/README.md

@@ -0,0 +1,23 @@
+class MapSum {
+    private var data: [String: Int]
+    private var t: [String: Int]
+
+    init() {
+        data = [String: Int]()
+        t = [String: Int]()
+    }
+
+    func insert(_ key: String, _ val: Int) {
+        let old = t[key] ?? 0
+        t[key] = val
+        for i in 1...key.count {
+            let endIndex = key.index(key.startIndex, offsetBy: i)
+            let k = String(key[key.startIndex..<endIndex])
+            data[k, default: 0] += (val - old)
+        }
+    }
+
+    func sum(_ prefix: String) -> Int {
+        return data[prefix] ?? 0
+    }
+}

lcof2/剑指 Offer II 066. 单词之和/Solution.swift

@@ -235,6 +235,34 @@ func findMaximumXOR(nums []int) int {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func findMaximumXOR(_ numbers: [Int]) -> Int {
+        var max = 0
+        var mask = 0
+
+        for i in stride(from: 30, through: 0, by: -1) {
+            let current = 1 << i
+            mask ^= current
+            var set = Set<Int>()
+            for num in numbers {
+                set.insert(mask & num)
+            }
+            let flag = max | current
+            for prefix in set {
+                if set.contains(prefix ^ flag) {
+                    max = flag
+                    break
+                }
+            }
+        }
+        return max
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof2/剑指 Offer II 067. 最大的异或/README.md

@@ -0,0 +1,23 @@
+class Solution {
+    func findMaximumXOR(_ numbers: [Int]) -> Int {
+        var max = 0
+        var mask = 0
+
+        for i in stride(from: 30, through: 0, by: -1) {
+            let current = 1 << i
+            mask ^= current
+            var set = Set<Int>()
+            for num in numbers {
+                set.insert(mask & num)
+            }
+            let flag = max | current
+            for prefix in set {
+                if set.contains(prefix ^ flag) {
+                    max = flag
+                    break
+                }
+            }
+        }
+        return max
+    }
+}

lcof2/剑指 Offer II 067. 最大的异或/Solution.swift

@@ -170,6 +170,26 @@ var searchInsert = function (nums, target) {
 };
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func searchInsert(_ nums: [Int], _ target: Int) -> Int {
+        var left = 0
+        var right = nums.count
+        while left < right {
+            let mid = (left + right) / 2
+            if nums[mid] >= target {
+                right = mid
+            } else {
+                left = mid + 1
+            }
+        }
+        return left
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->