leetcode 87. Scramble String 二分法

leetcode 87. Scramble String


public class Solution {
	public static void main(String[] args){
		String s1 = "ab";
		String s2 = "ba";
		Solution s = new Solution();
		System.out.println(s.isScramble(s1, s2));
	}
	
    public boolean isScramble(String s1, String s2) {
        if(s1.equals(s2))  return true;
        int[] letter = new int[26];
        if(s1.length()!=s2.length())  return false;
        for(int i=0;i


你可能感兴趣的:(算法)