LeetCode | 541. Reverse String II

最新推荐文章于 2024-11-06 23:21:54 发布

1LOVESJohnny

最新推荐文章于 2024-11-06 23:21:54 发布

阅读量263

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法 C++

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/122259971

版权

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

该博客介绍了如何实现一个C++函数，该函数接收一个字符串和一个整数k，然后按照指定规则反转字符串的子串。具体来说，每隔2k个字符，反转前k个字符。如果剩余字符不足k个，则反转所有剩余字符；如果不足2k但大于等于k个，则仅反转前k个。示例中展示了对于不同输入的字符串和k值，函数的预期输出。

摘要由CSDN通过智能技术生成

.

题目

Given a string s and an integer k, reverse the first k characters for every 2k characters counting from the start of the string.

If there are fewer than k characters left, reverse all of them. If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and left the other as original.

Example 1:

Input: s = “abcdefg”, k = 2
Output: “bacdfeg”

Example 2:

Input: s = “abcd”, k = 2
Output: “bacd”

Constraints:

1 <= s.length <= 10^4
s consists of only lowercase English letters.
1 <= k <= 10^4

.

代码

class Solution {
public:
    string reverseStr(string s, int k) {
        int i = 0;
		string rev;
		while(i < s.size()){
			int count = 0;
			string tmp;
			while(i<s.size() && count < k){
				tmp.push_back(s[i]);
				i ++, count ++;
			}
			reverse(tmp.begin(), tmp.end());
			rev += tmp;
			while(i<s.size() && count < 2*k){
				rev.push_back(s[i]);
				i ++, count ++;
			}
		}
		return rev;
    }
};