You are viewing a single comment's thread. Return to all comments →
static String[] bigSorting(String[] unsorted) { Arrays.sort(unsorted,new Comparator<String>(){ public int compare(String s1, String s2){ if(s1.length()!=s2.length()){ return s1.length()-s2.length(); } for(int i=0;i<s1.length();i++){ if(s1.charAt(i)!=s2.charAt(i)) return s1.charAt(i)-s2.charAt(i); } return 0; } }); return unsorted; still failing 6th test case
static String[] bigSorting(String[] unsorted) { Arrays.sort(unsorted,new Comparator<String>(){ public int compare(String s1, String s2){ if(s1.length()!=s2.length()){ return s1.length()-s2.length(); } for(int i=0;i<s1.length();i++){ if(s1.charAt(i)!=s2.charAt(i)) return s1.charAt(i)-s2.charAt(i); } return 0; } }); return unsorted;
Seems like cookies are disabled on this browser, please enable them to open this website
Big Sorting
You are viewing a single comment's thread. Return to all comments →
static String[] bigSorting(String[] unsorted) { Arrays.sort(unsorted,new Comparator<String>(){ public int compare(String s1, String s2){ if(s1.length()!=s2.length()){ return s1.length()-s2.length(); } for(int i=0;i<s1.length();i++){ if(s1.charAt(i)!=s2.charAt(i)) return s1.charAt(i)-s2.charAt(i); } return 0; } }); return unsorted;
still failing 6th test case