Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 86c222f

Browse files
Add solution for Best Sightseeing Pair
1 parent 328d742 commit 86c222f

File tree

2 files changed

+30
-2
lines changed

2 files changed

+30
-2
lines changed

‎README.md‎

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -129,9 +129,10 @@ Algorithm exercises from LeetCode implemented in Java v11.
129129
- Counting Bits | [Problem](https://leetcode.com/problems/counting-bits) | [Solution](src/solutions/CountingBits.java)
130130

131131
### Dynamic Programming
132-
- Count Sorted Vowel Strings | [Problem](https://leetcode.com/problems/count-sorted-vowel-strings) | [Solution](src/solutions/CountSortedVowelStrings.java)
133-
- Count Square Submatrices with All Ones | [Problem](https://leetcode.com/problems/count-square-submatrices-with-all-ones) | [Solution](src/solutions/CountSquareSubmatrices.java)
132+
- Best Sightseeing Pair | [Problem](https://leetcode.com/problems/best-sightseeing-pair) | [Solution](src/solutions/BestSightseeingPair.java)
134133
- Minimum Path Sum | [Problem](https://leetcode.com/problems/minimum-path-sum) | [Solution](src/solutions/MinimumPathSum.java)
135134
- Minimum Falling Path Sum | [Problem](https://leetcode.com/problems/minimum-falling-path-sum) | [Solution](src/solutions/MinimumFallingPathSum.java)
136135
- Maximum Number of Points with Cost | [Problem](https://leetcode.com/problems/maximum-number-of-points-with-cost) | [Solution](src/solutions/MaximumNumberOfPointsWithCost.java)
136+
- Count Sorted Vowel Strings | [Problem](https://leetcode.com/problems/count-sorted-vowel-strings) | [Solution](src/solutions/CountSortedVowelStrings.java)
137+
- Count Square Submatrices with All Ones | [Problem](https://leetcode.com/problems/count-square-submatrices-with-all-ones) | [Solution](src/solutions/CountSquareSubmatrices.java)
137138
- Partition Equal Subset Sum | [Problem](https://leetcode.com/problems/partition-equal-subset-sum) | [Solution](src/solutions/PartitionEqualSubsetSum.java)
Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
package solutions;
2+
3+
// [Problem] https://leetcode.com/problems/best-sightseeing-pair
4+
class BestSightseeingPair {
5+
// Bottom-up DP
6+
// O(n) time, O(1) space
7+
public int maxScoreSightseeingPair(int[] values) {
8+
int maxPair = values[0];
9+
int maxScore = 0;
10+
for (int i = 1; i < values.length; i++) {
11+
maxScore = Math.max(maxScore, values[i] + maxPair - 1);
12+
maxPair = Math.max(maxPair - 1, values[i]);
13+
}
14+
return maxScore;
15+
}
16+
17+
// Test
18+
public static void main(String[] args) {
19+
BestSightseeingPair solution = new BestSightseeingPair();
20+
21+
int[] input = {8, 1, 5, 2, 6};
22+
int expectedOutput = 11;
23+
int actualOutput = solution.maxScoreSightseeingPair(input);
24+
25+
System.out.println("Test passed? " + (expectedOutput == actualOutput));
26+
}
27+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /