判断某字符串 是否是该字符串的旋转词

import java.util.Scanner;public class TreePrinter {static TreePrinter mm = new TreePrinter();public static void main(String[] args) {Scanner scanner = new Scanner(System.in);String A = scanner.nextLine();String B = scanner.nextLine();System.out.println(mm.chkRotation3(A, A.length(), B, B.length()));}//方法一public boolean chkRotation1(String A, int lena, String B, int lenb) {// write code hereif (lena != lenb) {return false;}String C = A + A;char[] bb = B.toCharArray();char[] cc = C.toCharArray();for (int i = 0; i < cc.length; i++) {for (int j = 0; j < bb.length; j++) {if (cc[i] == bb[j]) {return true;}}}return false;}//方法二public boolean chkRotation2(String A, int lena, String B, int lenb) {if(lena!= lenb || A== null || B==null){return false;}String C = A+A;if(C.contains(B)){return true;}return false;}//方法三public boolean chkRotation3(String A, int lena, String B, int lenb) {if(lena!= lenb || A== null || B==null){return false;}String C = A+A;for(int i=0;i<C.length();i++){if(i+lena < C.length()){if(C.substring(i,i+lena).equals(B)){return true;}}}return false;}}