541. Reverse String II

最新推荐文章于 2019-06-18 10:50:37 发布

风雨中的人们

最新推荐文章于 2019-06-18 10:50:37 发布

阅读量840

点赞数 1

分类专栏： C

本文链接：https://blog.csdn.net/u011332835/article/details/61628163

版权

C 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less 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:

Input: s = "abcdefg", k = 2
Output: "bacdfeg"

Restrictions:

The string consists of lower English letters only.
Length of the given string and k will in the range [1, 10000]

直接上代码：

char* reverseStr(char* s, int k) {
    int temp,length;
	int i,j;
	length=strlen(s);
		temp=length/(2*k);
		for(i=0;i<temp;i++){
				reverse(s,i*2*k,i*2*k+k-1);
		}
		if(length%(2*k)<k){
			reverse(s,temp*2*k,length-1);
		}else{
			reverse(s,temp*2*k,temp*2*k+k-1);
		}
		return s;
}
void reverse(char *s,int m,int n){
	int mid,i;
	char temp;
	mid=(m+n)/2;
	
	if(m!=n){
		for(i=m;i<=mid&&m<=n;i++){
			temp=s[m];
			s[m]=s[n];
			s[n]=temp;
			m++;
			n--;
		}
	}
}