Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: add swift implementation to lcci problem: No.17.24 #2822

Merged
merged 1 commit into from
May 16, 2024
Merged

feat: add swift implementation to lcci problem: No.17.24 #2822

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
43 changes: 43 additions & 0 deletions lcci/17.24.Max Submatrix/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -190,6 +190,49 @@ func getMaxMatrix(matrix [][]int) []int {
}
```

```swift
class Solution {
func getMaxMatrix(_ matrix: [[Int]]) -> [Int] {
let m = matrix.count, n = matrix[0].count
var s = Array(repeating: Array(repeating: 0, count: n), count: m + 1)

for i in 0..<m {
for j in 0..<n {
s[i + 1][j] = s[i][j] + matrix[i][j]
}
}

var mx = matrix[0][0]
var ans = [0, 0, 0, 0]

for i1 in 0..<m {
for i2 in i1..<m {
var nums = [Int](repeating: 0, count: n)
for j in 0..<n {
nums[j] = s[i2 + 1][j] - s[i1][j]
}

var start = 0
var f = nums[0]
for j in 1..<n {
if f > 0 {
f += nums[j]
} else {
f = nums[j]
start = j
}
if f > mx {
mx = f
ans = [i1, start, i2, j]
}
}
}
}
return ans
}
}
```

<!-- tabs:end -->

<!-- end -->
43 changes: 43 additions & 0 deletions lcci/17.24.Max Submatrix/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -195,6 +195,49 @@ func getMaxMatrix(matrix [][]int) []int {
}
```

```swift
class Solution {
func getMaxMatrix(_ matrix: [[Int]]) -> [Int] {
let m = matrix.count, n = matrix[0].count
var s = Array(repeating: Array(repeating: 0, count: n), count: m + 1)

for i in 0..<m {
for j in 0..<n {
s[i + 1][j] = s[i][j] + matrix[i][j]
}
}

var mx = matrix[0][0]
var ans = [0, 0, 0, 0]

for i1 in 0..<m {
for i2 in i1..<m {
var nums = [Int](repeating: 0, count: n)
for j in 0..<n {
nums[j] = s[i2 + 1][j] - s[i1][j]
}

var start = 0
var f = nums[0]
for j in 1..<n {
if f > 0 {
f += nums[j]
} else {
f = nums[j]
start = j
}
if f > mx {
mx = f
ans = [i1, start, i2, j]
}
}
}
}
return ans
}
}
```

<!-- tabs:end -->

<!-- end -->
40 changes: 40 additions & 0 deletions lcci/17.24.Max Submatrix/Solution.swift
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
class Solution {
func getMaxMatrix(_ matrix: [[Int]]) -> [Int] {
let m = matrix.count, n = matrix[0].count
var s = Array(repeating: Array(repeating: 0, count: n), count: m + 1)

for i in 0..<m {
for j in 0..<n {
s[i + 1][j] = s[i][j] + matrix[i][j]
}
}

var mx = matrix[0][0]
var ans = [0, 0, 0, 0]

for i1 in 0..<m {
for i2 in i1..<m {
var nums = [Int](repeating: 0, count: n)
for j in 0..<n {
nums[j] = s[i2 + 1][j] - s[i1][j]
}

var start = 0
var f = nums[0]
for j in 1..<n {
if f > 0 {
f += nums[j]
} else {
f = nums[j]
start = j
}
if f > mx {
mx = f
ans = [i1, start, i2, j]
}
}
}
}
return ans
}
}
Loading