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 solutions to lc problem: No.3033 #2337

Merged
merged 13 commits into from
Feb 11, 2024
Merged

feat: add solutions to lc problem: No.3033 #2337

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
13 commits
Select commit Hold shift + click to select a range
fae01f7
feat: add solutions to lc problem: No.3032
Nothing-avil Feb 11, 2024
09ec437
feat: add solutions to lc problem: No.3033
Nothing-avil Feb 11, 2024
fb73355
feat: add solutions to lc problem: No.3033
Nothing-avil Feb 11, 2024
a5769b8
feat: add solutions to lc problem: No.3033
Nothing-avil Feb 11, 2024
e128538
feat: add solutions to lc problem: No.3033
Nothing-avil Feb 11, 2024
5044c4d
feat: add solutions to lc problem: No.3033
Nothing-avil Feb 11, 2024
3cbe18d
feat: add solutions to lc problem: No.3033
Nothing-avil Feb 11, 2024
10084fd
feat: add solutions to lc problem: No.3033
Nothing-avil Feb 11, 2024
21b861b
feat: add solutions to lc problem: No.3033
Nothing-avil Feb 11, 2024
0127e38
style: format code and docs with prettier
Nothing-avil Feb 11, 2024
d5da142
feat: add solutions to lc problem: No.3033
Nothing-avil Feb 11, 2024
46b0f0b
feat: add solutions to lc problem: No.3033
Nothing-avil Feb 11, 2024
7a6d68b
feat: add solutions to lc problem: No.3033
Nothing-avil Feb 11, 2024
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
88 changes: 85 additions & 3 deletions solution/3000-3099/3033.Modify the Matrix/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -49,19 +49,101 @@
<!-- tabs:start -->

```python

class Solution:
def modifiedMatrix(self, matrix: List[List[int]]) -> List[List[int]]:
rows = len(matrix)
cols = len(matrix[0])
for i in range(cols):
max_val = float('-inf')
for j in range(rows):
max_val = max(max_val, matrix[j][i])
for j in range(rows):
if matrix[j][i] == -1:
matrix[j][i] = max_val
return matrix
```

```java

class Solution {
public int[][] modifiedMatrix(int[][] matrix) {
int r = matrix.length;
int c = matrix[0].length;
for (int i = 0; i < c; i++) {
int maxs = Integer.MIN_VALUE;
for (int j = 0; j < r; j++) {
maxs = Math.max(maxs, matrix[j][i]);
}
for (int j = 0; j < r; j++) {
if (matrix[j][i] == -1) {
matrix[j][i] = maxs;
}
}
}
return matrix;
}
}
```

```cpp

class Solution {
public:
vector<vector<int>> modifiedMatrix(vector<vector<int>>& matrix) {
int r = matrix.size();
int c = matrix[0].size();
for (int i = 0; i < c; i++) {
int maxs = INT_MIN;
for (int j = 0; j < r; j++) {
maxs = max(maxs, matrix[j][i]);
}
for (int j = 0; j < r; j++) {
if (matrix[j][i] == -1) {
matrix[j][i] = maxs;
}
}
}
return matrix;
}
};
```

```go
func modifiedMatrix(matrix [][]int) [][]int {
r := len(matrix)
c := len(matrix[0])
for i := 0; i < c; i++ {
maxs := math.MinInt32
for j := 0; j < r; j++ {
if matrix[j][i] > maxs {
maxs = matrix[j][i]
}
}
for j := 0; j < r; j++ {
if matrix[j][i] == -1 {
matrix[j][i] = maxs
}
}
}
return matrix
}
```

```ts
function modifiedMatrix(matrix: number[][]): number[][] {
const rows = matrix.length;
const cols = matrix[0].length;
for (let i = 0; i < cols; i++) {
let maxVal = Number.MIN_SAFE_INTEGER;
for (let j = 0; j < rows; j++) {
maxVal = Math.max(maxVal, matrix[j][i]);
}
for (let j = 0; j < rows; j++) {
if (matrix[j][i] === -1) {
matrix[j][i] = maxVal;
}
}
}
return matrix;
}
```

<!-- tabs:end -->
Expand Down
88 changes: 85 additions & 3 deletions solution/3000-3099/3033.Modify the Matrix/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -45,19 +45,101 @@
<!-- tabs:start -->

```python

class Solution:
def modifiedMatrix(self, matrix: List[List[int]]) -> List[List[int]]:
rows = len(matrix)
cols = len(matrix[0])
for i in range(cols):
max_val = float('-inf')
for j in range(rows):
max_val = max(max_val, matrix[j][i])
for j in range(rows):
if matrix[j][i] == -1:
matrix[j][i] = max_val
return matrix
```

```java

class Solution {
public int[][] modifiedMatrix(int[][] matrix) {
int r = matrix.length;
int c = matrix[0].length;
for (int i = 0; i < c; i++) {
int maxs = Integer.MIN_VALUE;
for (int j = 0; j < r; j++) {
maxs = Math.max(maxs, matrix[j][i]);
}
for (int j = 0; j < r; j++) {
if (matrix[j][i] == -1) {
matrix[j][i] = maxs;
}
}
}
return matrix;
}
}
```

```cpp

class Solution {
public:
vector<vector<int>> modifiedMatrix(vector<vector<int>>& matrix) {
int r = matrix.size();
int c = matrix[0].size();
for (int i = 0; i < c; i++) {
int maxs = INT_MIN;
for (int j = 0; j < r; j++) {
maxs = max(maxs, matrix[j][i]);
}
for (int j = 0; j < r; j++) {
if (matrix[j][i] == -1) {
matrix[j][i] = maxs;
}
}
}
return matrix;
}
};
```

```go
func modifiedMatrix(matrix [][]int) [][]int {
r := len(matrix)
c := len(matrix[0])
for i := 0; i < c; i++ {
maxs := math.MinInt32
for j := 0; j < r; j++ {
if matrix[j][i] > maxs {
maxs = matrix[j][i]
}
}
for j := 0; j < r; j++ {
if matrix[j][i] == -1 {
matrix[j][i] = maxs
}
}
}
return matrix
}
```

```ts
function modifiedMatrix(matrix: number[][]): number[][] {
const rows = matrix.length;
const cols = matrix[0].length;
for (let i = 0; i < cols; i++) {
let maxVal = Number.MIN_SAFE_INTEGER;
for (let j = 0; j < rows; j++) {
maxVal = Math.max(maxVal, matrix[j][i]);
}
for (let j = 0; j < rows; j++) {
if (matrix[j][i] === -1) {
matrix[j][i] = maxVal;
}
}
}
return matrix;
}
```

<!-- tabs:end -->
Expand Down
19 changes: 19 additions & 0 deletions solution/3000-3099/3033.Modify the Matrix/Solution.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
class Solution {
public:
vector<vector<int>> modifiedMatrix(vector<vector<int>>& matrix) {
int r = matrix.size();
int c = matrix[0].size();
for (int i = 0; i < c; i++) {
int maxs = INT_MIN;
for (int j = 0; j < r; j++) {
maxs = max(maxs, matrix[j][i]);
}
for (int j = 0; j < r; j++) {
if (matrix[j][i] == -1) {
matrix[j][i] = maxs;
}
}
}
return matrix;
}
};
18 changes: 18 additions & 0 deletions solution/3000-3099/3033.Modify the Matrix/Solution.go
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
func modifiedMatrix(matrix [][]int) [][]int {
r := len(matrix)
c := len(matrix[0])
for i := 0; i < c; i++ {
maxs := math.MinInt32
for j := 0; j < r; j++ {
if matrix[j][i] > maxs {
maxs = matrix[j][i]
}
}
for j := 0; j < r; j++ {
if matrix[j][i] == -1 {
matrix[j][i] = maxs
}
}
}
return matrix
}
18 changes: 18 additions & 0 deletions solution/3000-3099/3033.Modify the Matrix/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
class Solution {
public int[][] modifiedMatrix(int[][] matrix) {
int r = matrix.length;
int c = matrix[0].length;
for (int i = 0; i < c; i++) {
int maxs = Integer.MIN_VALUE;
for (int j = 0; j < r; j++) {
maxs = Math.max(maxs, matrix[j][i]);
}
for (int j = 0; j < r; j++) {
if (matrix[j][i] == -1) {
matrix[j][i] = maxs;
}
}
}
return matrix;
}
}
12 changes: 12 additions & 0 deletions solution/3000-3099/3033.Modify the Matrix/Solution.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
class Solution:
def modifiedMatrix(self, matrix: List[List[int]]) -> List[List[int]]:
rows = len(matrix)
cols = len(matrix[0])
for i in range(cols):
max_val = float('-inf')
for j in range(rows):
max_val = max(max_val, matrix[j][i])
for j in range(rows):
if matrix[j][i] == -1:
matrix[j][i] = max_val
return matrix
16 changes: 16 additions & 0 deletions solution/3000-3099/3033.Modify the Matrix/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
function modifiedMatrix(matrix: number[][]): number[][] {
const rows = matrix.length;
const cols = matrix[0].length;
for (let i = 0; i < cols; i++) {
let maxVal = Number.MIN_SAFE_INTEGER;
for (let j = 0; j < rows; j++) {
maxVal = Math.max(maxVal, matrix[j][i]);
}
for (let j = 0; j < rows; j++) {
if (matrix[j][i] === -1) {
matrix[j][i] = maxVal;
}
}
}
return matrix;
}
Loading