拼凑正方形 java实现

  

   

import java.util.Arrays;
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int index = 0;
		int[] edge = new  int[4];
		while(scanner.hasNext()) {	
			edge[index++] = scanner.nextInt();
			if(index == 4) {
				break;
			}
		}
		
		Arrays.sort(edge);
		System.out.println(getMinCoin(edge));
	}
	private static int getMinCoin(int[] edge) {
		int min = Integer.MAX_VALUE;
		int sum = 0;
		int change_0 = 0;
		int change_1 = 0;
		int change_2 = 0;
		int change_3 = 0;
		
		for(int i=edge[0];i<=edge[3];i++) {
			change_0 = i > edge[0] ? i - edge[0] : edge[0] - i;
			change_1 = i > edge[1] ? i - edge[1] : edge[1] - i;
			change_2 = i > edge[2] ? i - edge[2] : edge[2] - i;
			change_3 = i > edge[3] ? i - edge[3] : edge[3] - i;
			sum = change_0 + change_1 + change_2 + change_3;
			if(sum < min) {
				min = sum;
			}
		}
		return min;
	}
}