未完成 Anagrams

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

/**
 * Created by cuihongyu on 2017/06/23.
 */
public class Solution {

    public static void main(String[] args) {
        String[] strings = {"", "", "eat", "den", "tea", "and", "ate"};
        System.out.print(anagrams(strings));
    }

    /**
     * @param strs A list of strings
     * @return A list of strings
     */
    public static List<String> anagrams(String[] strs) {
        List<String> result = new ArrayList<String>();
        if (strs == null) {
            return result;
        }
        for (int index1 = 0; index1 < strs.length; index1++) {
            boolean hasAnagram = false;
            int index2;
            for (index2 = index1 + 1; index2 < strs.length; index2++) {
                if (isAnagram(strs[index1], strs[index2])) {
                    if (!hasAnagram) {
                        result.add(strs[index1]);
                    }
                    result.add(strs[index2]);
                    hasAnagram = true;
                }
            }
        }
//        Set<String> set = new HashSet<String>();
//        set.addAll(result);
//        result.clear();
//        result.addAll(set);
        return result;
    }
    
    private static boolean isBreak(int index, boolean s2) {
        
        return s2;
    }
    
    /**
     * 判断两个数是否是anagram
     * @param s1 The first string
     * @param s2 The second string
     * @return true or false
     */
    private static boolean isAnagram(String s1, String s2) {
        if (s1.length() != s2.length()) {
            return false;
        }
        char[] charS1 = s1.toCharArray();
        char[] charS2 = s2.toCharArray();
        int[] nums = new int[127];
        int index;
        for (int i = 0; i < s1.length(); i++) {
            index = charS1[i] - 'a';
            nums[index]++;
            index = charS2[i] - 'a';
            nums[index]--;
        }
        for (int j = 0; j < 127; j++) {
            if (nums[j] != 0) {
                return false;
            }
        }
        return true;
    }
}