Skip to content

Commit bdf975a

Browse files
authored
Update find-the-lexicographically-largest-string-from-the-box-i.cpp
1 parent 37af924 commit bdf975a

File tree

1 file changed

+8
-8
lines changed

1 file changed

+8
-8
lines changed

C++/find-the-lexicographically-largest-string-from-the-box-i.cpp

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -9,18 +9,18 @@ class Solution {
99
return word;
1010
}
1111
int idx = 0;
12-
for (int i = 1, l = 1; i < size(word); ++i) {
13-
if (word[i] == word[idx + (l - 1)]) {
12+
for (int i = 1, l = 0; i < size(word); ++i) {
13+
if (word[i] == word[idx + l]) {
1414
++l;
15-
} else if (word[i] < word[idx + (l - 1)]) {
16-
l = 1;
17-
} else if (word[i] > word[idx + (l - 1)]) {
18-
if (word[i - (l - 1)] >= word[i]) {
19-
idx = i - (l - 1);
15+
} else if (word[i] < word[idx + l]) {
16+
l = 0;
17+
} else if (word[i] > word[idx + l]) {
18+
if (word[i - l] >= word[i]) {
19+
idx = i - l;
2020
} else {
2121
idx = i;
2222
}
23-
l = 1;
23+
l = 0;
2424
}
2525
}
2626
return word.substr(idx, (size(word) - max((numFriends - 1) - idx, 0)) - idx);

0 commit comments

Comments
 (0)