feat: add swift implementation to lcof problem: No.47 (doocs#2928)

Author: klever34

lcof/面试题47. 礼物的最大价值/README.md

@@ -198,6 +198,26 @@ public class Solution {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func maxValue(_ grid: [[Int]]) -> Int {
+        let m = grid.count
+        let n = grid[0].count
+        var f = [[Int]](repeating: [Int](repeating: 0, count: n + 1), count: m + 1)
+
+        for i in 1...m {
+            for j in 1...n {
+                f[i][j] = max(f[i - 1][j], f[i][j - 1]) + grid[i - 1][j - 1]
+            }
+        }
+
+        return f[m][n]
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof/面试题47. 礼物的最大价值/Solution.swift

@@ -0,0 +1,15 @@
+class Solution {
+    func maxValue(_ grid: [[Int]]) -> Int {
+        let m = grid.count
+        let n = grid[0].count
+        var f = [[Int]](repeating: [Int](repeating: 0, count: n + 1), count: m + 1)
+        
+        for i in 1...m {
+            for j in 1...n {
+                f[i][j] = max(f[i - 1][j], f[i][j - 1]) + grid[i - 1][j - 1]
+            }
+        }
+        
+        return f[m][n]
+    }
+}