3403. Find the Lexicographically Largest String From the Box I
題目:
給一個字串 : word和一個整數 : numFriends
要把word分成numFriends個子字串
並且回傳按照字典序最大的子字串
思路 :
如果numFriends = 1 就直接回傳word
去找word裡面最大的字母maxChar
接著找出每個由maxChar開頭且符合條件的子字串
其中字典序最大的就是答案
C++ code :
class Solution {
public:
string answerString(string word, int numFriends)
{
if (numFriends == 1) {
return word;
}
int n = word.size();
char maxChar = 'a';
string ans = "";
for (int i = 0; i < n; i++) {
maxChar = max(maxChar, word[i]);
}
for (int i = 0; i < n; i++) {
if (word[i] == maxChar) {
int tmp = numFriends - 1 - i;
string tmpString = "";
tmpString = word.substr(i, n - i - max(0, tmp));
ans = max(ans, tmpString);
}
}
return ans;
}
};

大師捏