Find Largest and smallest number in an Array containing small as well as large numbers

import java.util.Arrays;
import java.util.Comparator;

public class Main {
    // Comparator function to compare two numbers
    // represented as strings
    static class StringComparator
        implements Comparator<String> {
        public int compare(String a, String b)
        {
            // Compare based on length
            if (a.length() != b.length()) {
                return Integer.compare(a.length(),
                                       b.length());
            }
            // If lengths are equal, compare
            // lexicographically
            return a.compareTo(b);
        }
    }

    public static void main(String[] args)
    {
        String[] arr
            = { "5677856", "657856745356587687698768",
                "67564", "45675645356576578564435647647" };

        // Sort the array using the custom comparator
        Arrays.sort(arr, new StringComparator());

        // The smallest number is at the beginning and the
        // largest is at the end
        String smallest = arr[0];
        String largest = arr[arr.length - 1];

        // Print the results
        System.out.println("Smallest: " + smallest);
        System.out.println("Largest: " + largest);
    }
}

// Java code for the above approach
import java.io.*;
public class GFG {
  static String[] findLargestAndSmallest(String[] numbers)
  {

    int N = numbers.length;
    int maxLen = 0, minLen = Integer.MAX_VALUE;
    String[] res = { "", "" };

    // To store smallest and largest
    // element respectively

    // Traverse each number in array
    for (int i = 0; i < N; i++) {
      int numLen = numbers[i].length();

      // Comparing current smallest
      // number with current number
      // If current number is smaller
      if (minLen > numLen) {
        minLen = numLen;
        res[0] = numbers[i];
      }

      // If current number is of same length
      // Perform digitwise comparison
      else if (minLen == numLen)
        res[0] = ((res[0].length()
                   > numbers[i].length())
                  ? res[0]
                  : numbers[i]);

      // Comparing current largest
      // number with current number

      // If current number is larger
      if (maxLen < numLen) {
        maxLen = numLen;
        res[1] = numbers[i];
      }

      // If current number is of same length
      // Perform digitwise comparison
      else if (maxLen == numLen)
        res[1]
        = (res[1].length() > numbers[i].length()
           ? res[1]
           : numbers[i]);
    }

    // Returning the result
    return res;
  }

  // driver code
  public static void main(String[] args)
  {
    String[] numbers
      = { "5677856", "657856745356587687698768",
         "67564", "45675645356576578564435647647" };
    // Calling the function
    String[] ans = findLargestAndSmallest(numbers);
    System.out.println("Smallest: " + ans[0]);
    System.out.print("Largest: " + ans[1]);
  }
}

// This code is contributed by phasing17