Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // 时间复杂度为O(m * n),空间复杂度为O(1)
- void LeftShiftOne(char* s, int n)
- {
- char t = s[0]; //保存第一个字符
- for (int i = 1; i < n; i++)
- {
- s[i - 1] = s[i];
- }
- s[n - 1] = t;
- }
- void LeftRotateString(char* s, int n, int m)
- {
- while (m--)
- {
- LeftShiftOne(s, n);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement