feat: add swift implementation to lcof2 problem: No.075 (#3409)

doocs · Aug 13, 2024 · 8e3db9e · 8e3db9e
1 parent 3c456ce
commit 8e3db9e
Show file tree

Hide file tree

Showing 2 changed files with 58 additions and 0 deletions.
diff --git a/lcof2/剑指 Offer II 075. 数组相对排序/README.md b/lcof2/剑指 Offer II 075. 数组相对排序/README.md
@@ -167,6 +167,38 @@ class Solution:
         return arr1
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func relativeSortArray(_ arr1: [Int], _ arr2: [Int]) -> [Int] {
+        var frequency = [Int](repeating: 0, count: 1001)
+        var result = [Int]()
+
+        for num in arr1 {
+            frequency[num] += 1
+        }
+
+        for num in arr2 {
+            while frequency[num] > 0 {
+                result.append(num)
+                frequency[num] -= 1
+            }
+        }
+
+        for num in 0..<frequency.count {
+            while frequency[num] > 0 {
+                result.append(num)
+                frequency[num] -= 1
+            }
+        }
+
+        return result
+    }
+}
+
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

diff --git a/lcof2/剑指 Offer II 075. 数组相对排序/Solution.swift b/lcof2/剑指 Offer II 075. 数组相对排序/Solution.swift
@@ -0,0 +1,26 @@
+class Solution {
+    func relativeSortArray(_ arr1: [Int], _ arr2: [Int]) -> [Int] {
+        var frequency = [Int](repeating: 0, count: 1001)
+        var result = [Int]()
+
+        for num in arr1 {
+            frequency[num] += 1
+        }
+
+        for num in arr2 {
+            while frequency[num] > 0 {
+                result.append(num)
+                frequency[num] -= 1
+            }
+        }
+
+        for num in 0..<frequency.count {
+            while frequency[num] > 0 {
+                result.append(num)
+                frequency[num] -= 1
+            }
+        }
+
+        return result
+    }
+}