暴力破解
package Demo;
import java.util.Scanner;
public class Main1 {
public static void main(String[] args) {
Scanner input=new Scanner(System.in);
int arr[]=new int[4];
for (int i = 0; i < arr.length; i++) {
arr[i]=input.nextInt();
}
int m=Math.abs(arr[2]-arr[0]);
int n=Math.abs(arr[3]-arr[1]);
gcd(m,n);
}
public static void gcd(int m,int n) {
int max=m>n?m:n;
int min=m<n?m:n;
for (int i = min; i>0; i--) {
if (max%i==0) {
System.out.println(i);
return;
}
}
}
}
递归:
package Demo;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner input=new Scanner(System.in);
int arr[]=new int [4];
for (int i = 0; i <4; i++) {
arr[i]=input.nextInt();
}
int n=Math.abs(arr[2]-arr[0]);
int m=Math.abs(arr[3]-arr[1]);
System.out.println(gcd(m,n));
}
public static int gcd(int m,int n) {
return n==0?m:gcd(n,m%n);
}
}