No need to sort

Author: dohyeon2

two-sum/dohyeon2.java

@@ -21,17 +21,12 @@ public int[] twoSum(int[] nums, int target) {
             boolean indexExists = index != null;
             boolean indexExistsAndIndexIsNotTheNum = indexExists && i != index;
             if (indexExistsAndIndexIsNotTheNum) {
-                // Manual sort
-                if (i < index) {
-                    return new int[] { i, index };
-                } else {
-                    return new int[] { index, i };
-                }
+                return new int[] { i, index };
             }
         }
 
         // If the valid answer is always exists this is not needed
         // But the compiler don't know about that
         return new int[2];
     }
-}
+}