//========================================
//*author: BBG
//*email:2625696827@qq.com
//*create time :2020-05-19 11:17
//*filename:practice.c
//*description:字符串右移n位
//思路:主要判断数组左移存放位置 *(q + ((i + n) % ret)) = *(p + i);
//同样右移也是如此交换等式左右2边
//========================================
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
char a[8] = "abcdefg";
int n = 2;
char *p = a;
int ret = strlen(p);
char b[ret + 1];
char *q = b;
int i = 0;
while(*(p + i) != '\0'){
*(q + ((i + n) % ret)) = *(p + i);
i++;
}
for(i = 0; i < ret; i++){
printf("%c", b[i]);
}
printf("\n");
return 0;
}
![在这里插入图片描述](https://img-blog.csdnimg.cn/20200520155810524.png)
字符串左、右移n位
最新推荐文章于 2023-10-27 14:03:26 发布