Anagrams

Given an array of strings, return all groups of strings that are anagrams.

Note: All inputs will be in lower-case.

By using Java, I have to implement a comparator which is too much work for a interview. I could not think of any other way of sorting String arrays.

public class Solution {
    public ArrayList<String> anagrams(String[] strs) {
		// Start typing your Java solution below
		// DO NOT write main() function
		ArrayList<String> res = new ArrayList<String>();
		if(strs.length < 1)
			return res;
		Arrays.sort(strs, comp);
		boolean next = false;
		for(int i = 0; i + 1 < strs.length; i++){
			if(equal(strs[i], strs[i + 1])){
				res.add(strs[i]);
				next = true;
			}
			else if(next){
				res.add(strs[i]);
				next = false;
			}
		}
		if(next)
			res.add(strs[strs.length - 1]);
		return res;
	}
	
	public boolean equal(String s1, String s2){
		char[] s1_char = s1.toCharArray();
		Arrays.sort(s1_char);
		char[] s2_char = s2.toCharArray();
		Arrays.sort(s2_char);
		if(s1_char.length != s2_char.length)
			return false;
		for(int i = 0; i < s1_char.length; i++){
			if(s1_char[i] != s2_char[i])
				return false;
		}
		return true;
	}
	
	public static Comparator<String> comp = new Comparator<String>(){
		public int compare(String s1, String s2){
			char[] s1_char = s1.toCharArray();
			Arrays.sort(s1_char);
			char[] s2_char = s2.toCharArray();
			Arrays.sort(s2_char);
			if(s1_char.length < s2_char.length)
				return -1;
			if(s1_char.length > s2_char.length)
				return 1;
			for(int i = 0; i < s1_char.length; i++){
				if(s1_char[i] < s2_char[i])
					return -1;
				if(s1_char[i] > s2_char[i])
					return 1;
			}
			return 0;
		}
	};
}