(程序员面试题)字符串处理之循环右移
来源:互联网 发布:杨他他淘宝客 编辑:程序博客网 时间:2024/06/13 09:55
#include <stdio.h>#define MAXLINE 4096void moven(char *to, const char *from, const int n){ const char *tmp = from; for (; *(tmp + n) != '\0'; tmp++); for (; (*to = *tmp) != '\0'; to++, tmp++); for (; *(from + n) != '\0'; from++) { *to++ = *from; } *to++ = '\0';}int main(int argc, char *argv[]){char result[MAXLINE];moven(result, argv[1], 2);printf("result = %s\n", result);return 0;}
运行结果如下:
cheny@cheny-laptop:~/string$ gcc -o moven moven.c
cheny@cheny-laptop:~/string$ ./moven aabbcc
result = ccaabb
cheny@cheny-laptop:~/string$ ./moven ccbbaa
result = aaccbb
这种面试题也比较典型,给定字符串,然后要向右移动n位,最右边的n位移动到字符串的最左边n位,写的不好请大家指正,谢谢!
- (程序员面试题)字符串处理之循环右移
- (程序员面试题)字符串处理之字符反转
- (程序员面试题)字符串处理之字符替换
- (程序员面试题)字符串处理之单词反转
- 字符串循环右移(一道面试题的代码实现)
- (程序员面试题)字符串处理之查找两个字符串的最大公共子字符串
- 字符串之循环右移
- (程序员面试题)字符串处理之获取字符串的所有子串
- (程序员面试题)字符串处理之删除指定相连字符
- (程序员面试题)字符串处理之找到第一个只出现一次的字符
- (程序员面试题)字符串处理之寻找最大不重复子串
- 【经典面试题】数组的循环右移
- 字符串处理——字符串循环右移
- 字符串循环右移
- 字符串循环右移
- 字符串循环右移
- 字符串循环右移
- 字符串循环右移
- you don't have permission to access / on this server(Apache Server权限访问问题)
- cocos2d-x节点(CCActionEase.h)API
- c#关于委托和事件(二)(介绍的很详细)
- reference和const reference的初始化
- HDU1008
- (程序员面试题)字符串处理之循环右移
- unicode utf-8 gb18030 gb2312 gbk各种编码对比
- MVC 只是一个思想,不是模式!! (2)
- 文件上传原理:Web上传文件的原理及实现
- 回来看看
- java项目怎样部署到tomcat中
- android中出现Only the original thread that created a view hierarchy can touch its views.错误解决方案
- HDU2899 Strange fuction(牛顿迭代法)
- cocos2d-x节点(CCActionGrid.h)API