洛谷P1152 欢乐的跳 Java题解

import java.util.Arrays;
import java.util.Scanner;
import java.util.Scanner;
public class P1152欢乐的跳 {
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] arr = new int[n];
        int[] minus = new int[n-1];
        for(int i=0;i<n;i++) {
            arr[i] = scanner.nextInt();
        }
        int j=0;       
        for(int i=0;i<n-1;i++) {      
            j++;                     
           minus[i] = Math.abs(arr[i]-arr[j]);               
        }
        Arrays.sort(minus);
        int count = 0;
        for(int i=1;i<n-1;i++) {
            for(int k=0;k<n-1;k++) {
                if(i == minus[k]) {
                    count++;
                }
            }
            if(count >=1 ) {
                count = 0;
            }else {
                System.out.println("Not jolly");
                return;
            }
        }
        System.out.println("Jolly");
    }

}