/**
* 1、检验质数:
*/
public boolean checkPrimeNumber(int number){
if(number==2){
return true;
}
if(number<2||number%2==0){
return false;
}
int middle = number/2;
for(int i=3;i<middle;i++){
if(number%i==0){
return false;
}
}
return true;
}
/**
* 2.求约数(除1和其本身的约数):0的约数是所有正整数,没意义,1的约数是1,也没有意义,不作考虑
*/
public Integer[] getDivisorNumber(int number){
if(number>3){
if(checkPrimeNumber(number)){
return new Integer[]{1,number};
}else{
int middle = number/2;
List<Integer> list = new ArrayList<Integer>();
for(int i=1;i<=middle;i++){
if(number%i==0){
list.add(i);
}
}
list.add(number);
Integer[] integer = list.toArray(new Integer[list.size()]);
return integer;
}
}else{
return new Integer[]{1,number};
}
* 1、检验质数:
*/
public boolean checkPrimeNumber(int number){
if(number==2){
return true;
}
if(number<2||number%2==0){
return false;
}
int middle = number/2;
for(int i=3;i<middle;i++){
if(number%i==0){
return false;
}
}
return true;
}
/**
* 2.求约数(除1和其本身的约数):0的约数是所有正整数,没意义,1的约数是1,也没有意义,不作考虑
*/
public Integer[] getDivisorNumber(int number){
if(number>3){
if(checkPrimeNumber(number)){
return new Integer[]{1,number};
}else{
int middle = number/2;
List<Integer> list = new ArrayList<Integer>();
for(int i=1;i<=middle;i++){
if(number%i==0){
list.add(i);
}
}
list.add(number);
Integer[] integer = list.toArray(new Integer[list.size()]);
return integer;
}
}else{
return new Integer[]{1,number};
}
}
............................待续!!!!!!!!!!!!!!