(Easy) Maximum Product of Three Numbers - LeetCode

class Solution {
    public int maximumProduct(int[] nums) {
        
        Arrays.sort(nums);
        
        int max_1  = nums[nums.length-1]*nums[nums.length-2]*nums[nums.length-3];
        
        //int max_2 = nums[0]*nums[1]*nums[2];
        
        int max_3 = nums[0]* nums[1]* nums[nums.length-1];
        
        
        
        for(int i = 0; i<nums.length; i++){
            System.out.print(nums[i]);
        }
        
        return Get(max_1,max_3);
        
    }
    
    public static int Get(int a,  int c){
        return a>c? a: c;
    }
}