Solution 26: Left spin string

Problem description

Defines the left rotation of a string: moves several characters in front of the string to the end of the string.

For example, the string "abcdef" left rotated 2 bits to get "Cdefab". The algorithm is required to implement the time complexity of O (n), the constant degree of space complexity.

Solution Ideas

Overall Flip + partial flip

Program

public class Leftrotatestring {public void leftrotate (char[] c, int k) {if (c = = NULL | | c.length = = 0) {return;} Reverse (c, 0, c.length-1); reverse (c, 0, c.length-k-1); reverse (c, c.length-k, c.length-1);} private void reverse (char[] C, int i, int j) {while (I < j) {char tmp = c[i];c[i] = c[j];c[j] = tmp;++i;--j;}}}

　　

Solution 26: Left spin string