给定一个字符串和一个偏移量,根据偏移量旋转字符串(从左向右旋转)
样例
对于字符串 “abcdefg”.
offset=0 => “abcdefg”
offset=1 => “gabcdef”
offset=2 => “fgabcde”
offset=3 => “efgabcd”
public class Solution {
/**
* @param str: an array of char
* @param offset: an integer
* @return: nothing
*/
public void rotateString(char[] str, int offset) {
if (str.length==0) {
return;
}
if (offset > str.length) {
offset = offset % str.length;//将循环次数最小化
}
for (int j = 0; j < offset; j++) {
for (int i = 1; i < str.length; i++) {
char ss = str[str.length - i];
str[str.length - i] = str[str.length - i - 1];
str[str.length - i - 1] = ss;
}
}
}
}