Skip to content

feat: add solutions to lc problems: No.3332,3334 #3677

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

Merged
merged 1 commit into from
Oct 27, 2024
Merged

feat: add solutions to lc problems: No.3332,3334 #3677

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
97 changes: 94 additions & 3 deletions solution/3300-3399/3332.Maximum Points Tourist Can Earn/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -81,25 +81,116 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3332.Ma
#### Python3

```python

class Solution:
def maxScore(
self, n: int, k: int, stayScore: List[List[int]], travelScore: List[List[int]]
) -> int:
f = [[-inf] * n for _ in range(k + 1)]
f[0] = [0] * n
for i in range(1, k + 1):
for j in range(n):
for h in range(n):
f[i][j] = max(
f[i][j],
f[i - 1][h]
+ (stayScore[i - 1][j] if j == h else travelScore[h][j]),
)
return max(f[k])
```

#### Java

```java

class Solution {
public int maxScore(int n, int k, int[][] stayScore, int[][] travelScore) {
int[][] f = new int[k + 1][n];
for (var g : f) {
Arrays.fill(g, Integer.MIN_VALUE);
}
Arrays.fill(f[0], 0);
for (int i = 1; i <= k; ++i) {
for (int j = 0; j < n; ++j) {
for (int h = 0; h < n; ++h) {
f[i][j] = Math.max(
f[i][j], f[i - 1][h] + (j == h ? stayScore[i - 1][j] : travelScore[h][j]));
}
}
}
return Arrays.stream(f[k]).max().getAsInt();
}
}
```

#### C++

```cpp

class Solution {
public:
int maxScore(int n, int k, vector<vector<int>>& stayScore, vector<vector<int>>& travelScore) {
int f[k + 1][n];
memset(f, 0xc0, sizeof(f));
memset(f[0], 0, sizeof(f[0]));
for (int i = 1; i <= k; ++i) {
for (int j = 0; j < n; ++j) {
for (int h = 0; h < n; ++h) {
f[i][j] = max(f[i][j], f[i - 1][h] + (j == h ? stayScore[i - 1][j] : travelScore[h][j]));
}
}
}
return *max_element(f[k], f[k] + n);
}
};
```

#### Go

```go
func maxScore(n int, k int, stayScore [][]int, travelScore [][]int) (ans int) {
f := make([][]int, k+1)
for i := range f {
f[i] = make([]int, n)
for j := range f[i] {
f[i][j] = math.MinInt32
}
}
for j := 0; j < n; j++ {
f[0][j] = 0
}
for i := 1; i <= k; i++ {
for j := 0; j < n; j++ {
f[i][j] = f[i-1][j] + stayScore[i-1][j]
for h := 0; h < n; h++ {
if h != j {
f[i][j] = max(f[i][j], f[i-1][h]+travelScore[h][j])
}
}
}
}
for j := 0; j < n; j++ {
ans = max(ans, f[k][j])
}
return
}
```

#### TypeScript

```ts
function maxScore(n: number, k: number, stayScore: number[][], travelScore: number[][]): number {
const f: number[][] = Array.from({ length: k + 1 }, () => Array(n).fill(-Infinity));
f[0].fill(0);
for (let i = 1; i <= k; ++i) {
for (let j = 0; j < n; ++j) {
for (let h = 0; h < n; ++h) {
f[i][j] = Math.max(
f[i][j],
f[i - 1][h] + (j == h ? stayScore[i - 1][j] : travelScore[h][j]),
);
}
}
}
return Math.max(...f[k]);
}
```

<!-- tabs:end -->
Expand Down
97 changes: 94 additions & 3 deletions solution/3300-3399/3332.Maximum Points Tourist Can Earn/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -78,25 +78,116 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3332.Ma
#### Python3

```python

class Solution:
def maxScore(
self, n: int, k: int, stayScore: List[List[int]], travelScore: List[List[int]]
) -> int:
f = [[-inf] * n for _ in range(k + 1)]
f[0] = [0] * n
for i in range(1, k + 1):
for j in range(n):
for h in range(n):
f[i][j] = max(
f[i][j],
f[i - 1][h]
+ (stayScore[i - 1][j] if j == h else travelScore[h][j]),
)
return max(f[k])
```

#### Java

```java

class Solution {
public int maxScore(int n, int k, int[][] stayScore, int[][] travelScore) {
int[][] f = new int[k + 1][n];
for (var g : f) {
Arrays.fill(g, Integer.MIN_VALUE);
}
Arrays.fill(f[0], 0);
for (int i = 1; i <= k; ++i) {
for (int j = 0; j < n; ++j) {
for (int h = 0; h < n; ++h) {
f[i][j] = Math.max(
f[i][j], f[i - 1][h] + (j == h ? stayScore[i - 1][j] : travelScore[h][j]));
}
}
}
return Arrays.stream(f[k]).max().getAsInt();
}
}
```

#### C++

```cpp

class Solution {
public:
int maxScore(int n, int k, vector<vector<int>>& stayScore, vector<vector<int>>& travelScore) {
int f[k + 1][n];
memset(f, 0xc0, sizeof(f));
memset(f[0], 0, sizeof(f[0]));
for (int i = 1; i <= k; ++i) {
for (int j = 0; j < n; ++j) {
for (int h = 0; h < n; ++h) {
f[i][j] = max(f[i][j], f[i - 1][h] + (j == h ? stayScore[i - 1][j] : travelScore[h][j]));
}
}
}
return *max_element(f[k], f[k] + n);
}
};
```

#### Go

```go
func maxScore(n int, k int, stayScore [][]int, travelScore [][]int) (ans int) {
f := make([][]int, k+1)
for i := range f {
f[i] = make([]int, n)
for j := range f[i] {
f[i][j] = math.MinInt32
}
}
for j := 0; j < n; j++ {
f[0][j] = 0
}
for i := 1; i <= k; i++ {
for j := 0; j < n; j++ {
f[i][j] = f[i-1][j] + stayScore[i-1][j]
for h := 0; h < n; h++ {
if h != j {
f[i][j] = max(f[i][j], f[i-1][h]+travelScore[h][j])
}
}
}
}
for j := 0; j < n; j++ {
ans = max(ans, f[k][j])
}
return
}
```

#### TypeScript

```ts
function maxScore(n: number, k: number, stayScore: number[][], travelScore: number[][]): number {
const f: number[][] = Array.from({ length: k + 1 }, () => Array(n).fill(-Infinity));
f[0].fill(0);
for (let i = 1; i <= k; ++i) {
for (let j = 0; j < n; ++j) {
for (let h = 0; h < n; ++h) {
f[i][j] = Math.max(
f[i][j],
f[i - 1][h] + (j == h ? stayScore[i - 1][j] : travelScore[h][j]),
);
}
}
}
return Math.max(...f[k]);
}
```

<!-- tabs:end -->
Expand Down
16 changes: 16 additions & 0 deletions solution/3300-3399/3332.Maximum Points Tourist Can Earn/Solution.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
class Solution {
public:
int maxScore(int n, int k, vector<vector<int>>& stayScore, vector<vector<int>>& travelScore) {
int f[k + 1][n];
memset(f, 0xc0, sizeof(f));
memset(f[0], 0, sizeof(f[0]));
for (int i = 1; i <= k; ++i) {
for (int j = 0; j < n; ++j) {
for (int h = 0; h < n; ++h) {
f[i][j] = max(f[i][j], f[i - 1][h] + (j == h ? stayScore[i - 1][j] : travelScore[h][j]));
}
}
}
return *max_element(f[k], f[k] + n);
}
};
26 changes: 26 additions & 0 deletions solution/3300-3399/3332.Maximum Points Tourist Can Earn/Solution.go
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
func maxScore(n int, k int, stayScore [][]int, travelScore [][]int) (ans int) {
f := make([][]int, k+1)
for i := range f {
f[i] = make([]int, n)
for j := range f[i] {
f[i][j] = math.MinInt32
}
}
for j := 0; j < n; j++ {
f[0][j] = 0
}
for i := 1; i <= k; i++ {
for j := 0; j < n; j++ {
f[i][j] = f[i-1][j] + stayScore[i-1][j]
for h := 0; h < n; h++ {
if h != j {
f[i][j] = max(f[i][j], f[i-1][h]+travelScore[h][j])
}
}
}
}
for j := 0; j < n; j++ {
ans = max(ans, f[k][j])
}
return
}
18 changes: 18 additions & 0 deletions solution/3300-3399/3332.Maximum Points Tourist Can Earn/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 maxScore(int n, int k, int[][] stayScore, int[][] travelScore) {
int[][] f = new int[k + 1][n];
for (var g : f) {
Arrays.fill(g, Integer.MIN_VALUE);
}
Arrays.fill(f[0], 0);
for (int i = 1; i <= k; ++i) {
for (int j = 0; j < n; ++j) {
for (int h = 0; h < n; ++h) {
f[i][j] = Math.max(
f[i][j], f[i - 1][h] + (j == h ? stayScore[i - 1][j] : travelScore[h][j]));
}
}
}
return Arrays.stream(f[k]).max().getAsInt();
}
}
15 changes: 15 additions & 0 deletions solution/3300-3399/3332.Maximum Points Tourist Can Earn/Solution.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
class Solution:
def maxScore(
self, n: int, k: int, stayScore: List[List[int]], travelScore: List[List[int]]
) -> int:
f = [[-inf] * n for _ in range(k + 1)]
f[0] = [0] * n
for i in range(1, k + 1):
for j in range(n):
for h in range(n):
f[i][j] = max(
f[i][j],
f[i - 1][h]
+ (stayScore[i - 1][j] if j == h else travelScore[h][j]),
)
return max(f[k])
15 changes: 15 additions & 0 deletions solution/3300-3399/3332.Maximum Points Tourist Can Earn/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
function maxScore(n: number, k: number, stayScore: number[][], travelScore: number[][]): number {
const f: number[][] = Array.from({ length: k + 1 }, () => Array(n).fill(-Infinity));
f[0].fill(0);
for (let i = 1; i <= k; ++i) {
for (let j = 0; j < n; ++j) {
for (let h = 0; h < n; ++h) {
f[i][j] = Math.max(
f[i][j],
f[i - 1][h] + (j == h ? stayScore[i - 1][j] : travelScore[h][j]),
);
}
}
}
return Math.max(...f[k]);
}
Loading
Loading