Skip to content

Commit c31e717

Browse files
Nothing-avilNothing-avil
authored
feat: add solutions to lc problem: No.3033 (doocs#2337)
1 parent ecece7a commit c31e717

File tree

7 files changed

+253
-6
lines changed

7 files changed

+253
-6
lines changed

‎solution/3000-3099/3033.Modify the Matrix/README.md

+85-3
Original file line numberDiff line numberDiff line change
@@ -49,19 +49,101 @@
4949
<!-- tabs:start -->
5050

5151
```python
52-
52+
class Solution:
53+
def modifiedMatrix(self, matrix: List[List[int]]) -> List[List[int]]:
54+
rows = len(matrix)
55+
cols = len(matrix[0])
56+
for i in range(cols):
57+
max_val = float('-inf')
58+
for j in range(rows):
59+
max_val = max(max_val, matrix[j][i])
60+
for j in range(rows):
61+
if matrix[j][i] == -1:
62+
matrix[j][i] = max_val
63+
return matrix
5364
```
5465

5566
```java
56-
67+
class Solution {
68+
public int[][] modifiedMatrix(int[][] matrix) {
69+
int r = matrix.length;
70+
int c = matrix[0].length;
71+
for (int i = 0; i < c; i++) {
72+
int maxs = Integer.MIN_VALUE;
73+
for (int j = 0; j < r; j++) {
74+
maxs = Math.max(maxs, matrix[j][i]);
75+
}
76+
for (int j = 0; j < r; j++) {
77+
if (matrix[j][i] == -1) {
78+
matrix[j][i] = maxs;
79+
}
80+
}
81+
}
82+
return matrix;
83+
}
84+
}
5785
```
5886

5987
```cpp
60-
88+
class Solution {
89+
public:
90+
vector<vector<int>> modifiedMatrix(vector<vector<int>>& matrix) {
91+
int r = matrix.size();
92+
int c = matrix[0].size();
93+
for (int i = 0; i < c; i++) {
94+
int maxs = INT_MIN;
95+
for (int j = 0; j < r; j++) {
96+
maxs = max(maxs, matrix[j][i]);
97+
}
98+
for (int j = 0; j < r; j++) {
99+
if (matrix[j][i] == -1) {
100+
matrix[j][i] = maxs;
101+
}
102+
}
103+
}
104+
return matrix;
105+
}
106+
};
61107
```
62108
63109
```go
110+
func modifiedMatrix(matrix [][]int) [][]int {
111+
r := len(matrix)
112+
c := len(matrix[0])
113+
for i := 0; i < c; i++ {
114+
maxs := math.MinInt32
115+
for j := 0; j < r; j++ {
116+
if matrix[j][i] > maxs {
117+
maxs = matrix[j][i]
118+
}
119+
}
120+
for j := 0; j < r; j++ {
121+
if matrix[j][i] == -1 {
122+
matrix[j][i] = maxs
123+
}
124+
}
125+
}
126+
return matrix
127+
}
128+
```
64129

130+
```ts
131+
function modifiedMatrix(matrix: number[][]): number[][] {
132+
const rows = matrix.length;
133+
const cols = matrix[0].length;
134+
for (let i = 0; i < cols; i++) {
135+
let maxVal = Number.MIN_SAFE_INTEGER;
136+
for (let j = 0; j < rows; j++) {
137+
maxVal = Math.max(maxVal, matrix[j][i]);
138+
}
139+
for (let j = 0; j < rows; j++) {
140+
if (matrix[j][i] === -1) {
141+
matrix[j][i] = maxVal;
142+
}
143+
}
144+
}
145+
return matrix;
146+
}
65147
```
66148

67149
<!-- tabs:end -->

‎solution/3000-3099/3033.Modify the Matrix/README_EN.md

+85-3
Original file line numberDiff line numberDiff line change
@@ -45,19 +45,101 @@
4545
<!-- tabs:start -->
4646

4747
```python
48-
48+
class Solution:
49+
def modifiedMatrix(self, matrix: List[List[int]]) -> List[List[int]]:
50+
rows = len(matrix)
51+
cols = len(matrix[0])
52+
for i in range(cols):
53+
max_val = float('-inf')
54+
for j in range(rows):
55+
max_val = max(max_val, matrix[j][i])
56+
for j in range(rows):
57+
if matrix[j][i] == -1:
58+
matrix[j][i] = max_val
59+
return matrix
4960
```
5061

5162
```java
52-
63+
class Solution {
64+
public int[][] modifiedMatrix(int[][] matrix) {
65+
int r = matrix.length;
66+
int c = matrix[0].length;
67+
for (int i = 0; i < c; i++) {
68+
int maxs = Integer.MIN_VALUE;
69+
for (int j = 0; j < r; j++) {
70+
maxs = Math.max(maxs, matrix[j][i]);
71+
}
72+
for (int j = 0; j < r; j++) {
73+
if (matrix[j][i] == -1) {
74+
matrix[j][i] = maxs;
75+
}
76+
}
77+
}
78+
return matrix;
79+
}
80+
}
5381
```
5482

5583
```cpp
56-
84+
class Solution {
85+
public:
86+
vector<vector<int>> modifiedMatrix(vector<vector<int>>& matrix) {
87+
int r = matrix.size();
88+
int c = matrix[0].size();
89+
for (int i = 0; i < c; i++) {
90+
int maxs = INT_MIN;
91+
for (int j = 0; j < r; j++) {
92+
maxs = max(maxs, matrix[j][i]);
93+
}
94+
for (int j = 0; j < r; j++) {
95+
if (matrix[j][i] == -1) {
96+
matrix[j][i] = maxs;
97+
}
98+
}
99+
}
100+
return matrix;
101+
}
102+
};
57103
```
58104
59105
```go
106+
func modifiedMatrix(matrix [][]int) [][]int {
107+
r := len(matrix)
108+
c := len(matrix[0])
109+
for i := 0; i < c; i++ {
110+
maxs := math.MinInt32
111+
for j := 0; j < r; j++ {
112+
if matrix[j][i] > maxs {
113+
maxs = matrix[j][i]
114+
}
115+
}
116+
for j := 0; j < r; j++ {
117+
if matrix[j][i] == -1 {
118+
matrix[j][i] = maxs
119+
}
120+
}
121+
}
122+
return matrix
123+
}
124+
```
60125

126+
```ts
127+
function modifiedMatrix(matrix: number[][]): number[][] {
128+
const rows = matrix.length;
129+
const cols = matrix[0].length;
130+
for (let i = 0; i < cols; i++) {
131+
let maxVal = Number.MIN_SAFE_INTEGER;
132+
for (let j = 0; j < rows; j++) {
133+
maxVal = Math.max(maxVal, matrix[j][i]);
134+
}
135+
for (let j = 0; j < rows; j++) {
136+
if (matrix[j][i] === -1) {
137+
matrix[j][i] = maxVal;
138+
}
139+
}
140+
}
141+
return matrix;
142+
}
61143
```
62144

63145
<!-- tabs:end -->

‎solution/3000-3099/3033.Modify the Matrix/Solution.cpp

+19
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
class Solution {
2+
public:
3+
vector<vector<int>> modifiedMatrix(vector<vector<int>>& matrix) {
4+
int r = matrix.size();
5+
int c = matrix[0].size();
6+
for (int i = 0; i < c; i++) {
7+
int maxs = INT_MIN;
8+
for (int j = 0; j < r; j++) {
9+
maxs = max(maxs, matrix[j][i]);
10+
}
11+
for (int j = 0; j < r; j++) {
12+
if (matrix[j][i] == -1) {
13+
matrix[j][i] = maxs;
14+
}
15+
}
16+
}
17+
return matrix;
18+
}
19+
};

‎solution/3000-3099/3033.Modify the Matrix/Solution.go

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
func modifiedMatrix(matrix [][]int) [][]int {
2+
r := len(matrix)
3+
c := len(matrix[0])
4+
for i := 0; i < c; i++ {
5+
maxs := math.MinInt32
6+
for j := 0; j < r; j++ {
7+
if matrix[j][i] > maxs {
8+
maxs = matrix[j][i]
9+
}
10+
}
11+
for j := 0; j < r; j++ {
12+
if matrix[j][i] == -1 {
13+
matrix[j][i] = maxs
14+
}
15+
}
16+
}
17+
return matrix
18+
}

‎solution/3000-3099/3033.Modify the Matrix/Solution.java

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
class Solution {
2+
public int[][] modifiedMatrix(int[][] matrix) {
3+
int r = matrix.length;
4+
int c = matrix[0].length;
5+
for (int i = 0; i < c; i++) {
6+
int maxs = Integer.MIN_VALUE;
7+
for (int j = 0; j < r; j++) {
8+
maxs = Math.max(maxs, matrix[j][i]);
9+
}
10+
for (int j = 0; j < r; j++) {
11+
if (matrix[j][i] == -1) {
12+
matrix[j][i] = maxs;
13+
}
14+
}
15+
}
16+
return matrix;
17+
}
18+
}

‎solution/3000-3099/3033.Modify the Matrix/Solution.py

+12
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
class Solution:
2+
def modifiedMatrix(self, matrix: List[List[int]]) -> List[List[int]]:
3+
rows = len(matrix)
4+
cols = len(matrix[0])
5+
for i in range(cols):
6+
max_val = float('-inf')
7+
for j in range(rows):
8+
max_val = max(max_val, matrix[j][i])
9+
for j in range(rows):
10+
if matrix[j][i] == -1:
11+
matrix[j][i] = max_val
12+
return matrix

‎solution/3000-3099/3033.Modify the Matrix/Solution.ts

+16
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
function modifiedMatrix(matrix: number[][]): number[][] {
2+
const rows = matrix.length;
3+
const cols = matrix[0].length;
4+
for (let i = 0; i < cols; i++) {
5+
let maxVal = Number.MIN_SAFE_INTEGER;
6+
for (let j = 0; j < rows; j++) {
7+
maxVal = Math.max(maxVal, matrix[j][i]);
8+
}
9+
for (let j = 0; j < rows; j++) {
10+
if (matrix[j][i] === -1) {
11+
matrix[j][i] = maxVal;
12+
}
13+
}
14+
}
15+
return matrix;
16+
}

0 commit comments

Comments
 (0)