【leetcode】Divide Two Integers

public class Solution {

	public int divide(int dividend, int divisor) {
		long a = Math.abs((long) dividend);
		long b = Math.abs((long) divisor);
		long res = 0;
		for (int i = 31; i >= 0; i--) {
			if (a >> i >= b) {
				res += 1 << i;
				a -= b << i;
			}
		}
		return (int) (((dividend ^ divisor) >> 31) == 0 ? (res) : (-res));
	}
}