字符串左旋暴力解法

#include <iostream>using namespace std;void leftshitone(char * s, int n){ char t = s[0]; // 保存第一个字符for (int i = 1; i < n; ++i){s[i-1] = s[i];}s[n - 1] = t;return ;}char * leftshit(char *s, int n, int m){while (m--){leftshitone(s, n);}return s;}int main(){char s[] = "tongshen";puts(leftshit(s, 8, 3));return 0;}