leetcode之Divide Two Integers

 public int divideOfMy(int dividend, int divisor) {
	       
	        if(divisor==0) return Integer.MAX_VALUE;         
		    if(divisor==-1 && dividend == Integer.MIN_VALUE)
		        return Integer.MAX_VALUE;
		 
		    //get positive values
		    long div = Math.abs((long)dividend);
		    long div2 = Math.abs((long)divisor);
		    
	       int k1=getK(div);
	       int k2=getK(div2);
	       
	       int result=0;
	       long sam=div2;
	       
	       div2=div2<<(k1-k2);
	       int count=k1-k2+1;
	       
	       while(count>0){
	    	   result=result<<1;
	    	   if(div>=div2){
	    		   ++result;
	    		   div=div-div2;
	    	   }
	    	   div2=div2>>1;
	    	   count--;
	       }
	       return ((dividend<0)^(divisor<0))? -result:result;  
	    	   
	    }
	public static int getK(long div){
		int count=0;
		while(div>0){
			++count;
			div=div>>1;
		}
        return count;
	}