numberprocess.java~3~

Birch

//package datamining;

/**
 * <p>Title: </p>
 *
 * <p>Description: </p>
 *
 * <p>Copyright: Copyright (c) 2005</p>
 *
 * <p>Company: </p>
 *
 * @author not attributable
 * @version 1.0
 */
public class numberProcess {

    public static boolean isOdd(int number){
        boolean tempFlag=false;
        if((float)number/2>(int)number/2){
            tempFlag=true;
        }
        return tempFlag;
    }
    public static int getRemain(int Num,int divideNum){
        return Num%divideNum;
    }
    public static int whichIsMin(double[] value){
        int MinPosition=0;
        for(int i=0;i<value.length-1;i++){
            if(value[i+1]<value[i]){
                MinPosition=i+1;
            }
        }
        return MinPosition;
    }
    public static boolean hasRemain(double value){//是否有余数
        int temp=(int)value;
        boolean tempFlag=false;
        if((value-temp)>0){
            tempFlag=true;
        }
        return tempFlag;
    }
    public static String alltrim(String str){
       String trimStr="";
       for(int i=0;i<str.length();i++){
           if(!String.valueOf(str.charAt(i)).equals(" ")){
               trimStr=trimStr+String.valueOf(str.charAt(i));
           }

       }
       return trimStr;
   }

    public numberProcess() {
    }
}