数组中连续数的计数

Question

问题H[最长自然后继数]如果第二个是自然数序列中第一个的后继数（1和2是自然后继数），则两个连续的整数是自然后继数。编写一个程序，读取一个数字N，后跟N个整数，然后打印连续自然后继的最长序列的长度。示例：

输入
7 2 3 5 6 7 9 10输出3这里是我的代码到目前为止有人能帮我吗

   import java.util.Scanner;


   public class Conse {

public static void main(String[] args) {
    // TODO Auto-generated method stub
     Scanner scan = new Scanner(System.in); 
     int x=scan.nextInt();
     int[] array= new int[x];
     for(int i=0;i<array.length;i++)
         array[i]=scan.nextInt();
     System.out.println(array(array));


     }
   public static int array(int[] array){
    int count=0,temp=0;
    for(int i=0;i<array.length;i++){
        count=0;
        for(int j=i,k=i+1;j<array.length-1;j++,k++)
            if(array[j]-array[k]==1)
                count++;
            else{if(temp<count)
                temp=count;
            break;}
        }
    return temp+1;
    }

   }

Answer 1

int sequenceStart = 0;
int sequenceLength = 0;
int longestSequenceLength = 0;
for (int item: array) {
    if (item == sequenceStart + sequenceLength) {
        sequenceLength++;
    } else {
        sequenceStart = item;
        sequenceLength = 1;
    }
    longestSequenceLength = Math.max(longestSequenceLength, sequenceLength);
}