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 8ac1760

Browse files
Merge pull request youngyangyang04#2137 from Lozakaka/patch-25
說明JAVA code需要注意的地方
2 parents 6acb20d + 3becfab commit 8ac1760

File tree

1 file changed

+1
-0
lines changed

1 file changed

+1
-0
lines changed

‎problems/0674.最长连续递增序列.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -177,6 +177,7 @@ Java:
177177
dp[i] = 1;
178178
}
179179
int res = 1;
180+
//可以注意到,這邊的 i 是從 0 開始,所以會出現和卡哥的C++ code有差異的地方,在一些地方會看到有 i + 1 的偏移。
180181
for (int i = 0; i < nums.length - 1; i++) {
181182
if (nums[i + 1] > nums[i]) {
182183
dp[i + 1] = dp[i] + 1;

0 commit comments

Comments
(0)

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