import java.util.*;

public class NextElement {


   public int[] findNext(int[] A, int n) {
        if (n == 0 ) return  A;
         if ( n == 1) return  new int[]{-1};
 
 
 
        int[] arrayData = new int[n];
        for (int i = 0; i < n; i++) {
            int num = A[i];
            arrayData[i] = -1;
            for (int j = i + 1; j < n; j++) {
                if (A[j] > num) {
                    arrayData[i] = A[j];
                    break;
                }
            }
        }
 
        // write code here
        return arrayData;
    }
}
思路:双层循环 ,并对 数组长度为0-1时做处理