检查连续号码的Java方法

Question

我需要编写一个称为连续的方法，它需要6个参数来检查6个输入是否是连续的数字，而不管顺序如何。如果数字是连续的，则返回true，否则返回false。有人能教我什么是最有效的方法吗？我试过这种方法，但如果我有6个数字，效率会很低？

public static boolean consecutive(int numberOne,int numberTwo,int numberThree) { 
    if(((numberTwo==numberOne-1) && (numberThree== numberTwo-1)) || ((numberTwo==numberOne+1) && (numberThree==numberTwo+1)) || ((numberTwo==numberOne+2) &&(numberThree==numberOne+1)) || ((numberTwo==numberOne-1)&& (numberThree==numberOne+1)) || ((numberTwo==numberOne-2) && (numberThree==numberOne-1)) ||((numberTwo==numberOne+1) && (numberThree==numberOne-1))){ 
     return true; 
    }else{ 
     return false; 
    } 
} 

} 

Answer 1

值添加到一个数组，数组排序，然后测试顺序组值：

int[] test = new int[] {numberOne, numberTwo, etc...}; 
Arrays.sort(test); 
for (int i = 0; i < test.length - 1; i++) { 
    if (test[i] + 1 != test[i + 1]) { 
    // Not sequential 
    } 
} 

Answer 2

加强@克里斯的回答，假设没有重复号码：

public static boolean consecutive(
    int numberOne,int numberTwo,int numberThree, 
    int numberFour, int numberFive, int numberSix) { 

int [] ns = { 
    numberOne, numberTwo, numberThree, 
    numberFour, numberFive, numberSix }; 

Arrays.sort(ns); 

return (ns[ns.length-1] - ns[0] == ns.length-1); 
}