用java求解最长两数序列

class Main {
    public static int longestConsecutive(int[] nums) {
        int s = 0;
        int y = 0;
        int r = 0;
        if(nums.length==0)
        {return s;}
        for(int i= 0;i<=nums.length-1;i++)
        {
            for(int j=i+1;j<=nums.length-1;j++)
            {
                if(nums[i]>nums[j])
                {int a = 0;
                    a = nums[i];
                    nums[i] = nums[j];
                    nums[j] = a;
                }}}
        for(int b = 0;b< nums.length-1;b++)
        {
            if(nums[b+1]-nums[b]==1)
                s++;
            else
            if(y<s&&nums[b+1]-nums[b]!=0) {
                y = s;
                s = 0;
            }
            else
            if(nums[b+1]-nums[b]==0)
            continue;
            else
            {r = s;
                s = 0;}

        }
        if(y<r)
            y=r;
        if(y<s)
            y = s;
        return y + 1;}


public static void main(String[] args)
{int[] x = {0,0,1,2,3,4,7,8,9,10,11,12,13,14,14,15,120,171,181,119};
System.out.println(longestConsecutive(x));
}

}