23 lines
771 B
C++
23 lines
771 B
C++
#include <string>
|
|
#include <iostream>
|
|
|
|
/**
|
|
* 2000. Reverse Prefix of Word
|
|
* Given a 0-indexed string word and a character ch, reverse the segment of word that starts at index 0 and ends at the index of the first occurrence of ch (inclusive). If the character ch does not exist in word, do nothing.
|
|
* For example, if word = "abcdefd" and ch = "d", then you should reverse the segment that starts at 0 and ends at 3 (inclusive). The resulting string will be "dcbaefd".
|
|
* Return the resulting string.
|
|
*/
|
|
|
|
class Solution {
|
|
public:
|
|
static std::string reversePrefix(std::string word, char ch) {
|
|
std::reverse(word.begin(), std::next(word.begin(), 1 + word.find(ch)));
|
|
return word;
|
|
}
|
|
};
|
|
|
|
int main() {
|
|
std::cout << Solution::reversePrefix("xyxzxe", 'z');
|
|
return 0;
|
|
}
|