坚持不懈

public int firstBadVersion(int n) { if(n==0){ return -1; } int start = 1, end = n, mid; while (start + 1 < end) { mid = start + (end - start)/2;

public class ValidAnagram {    public static boolean isAnagram(String s, String t) {        char[] sArr = s.toCharArray();          char[] tArr = t.toCharArray();          Arrays.sort(sArr);