2015年4月16日
[LeetCode] 29. Divide Two Integers 两数相除
摘要： Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator. The integer division should tru 阅读全文
posted @ 2015-04-16 14:04 Grandyang 阅读(32078) 评论(25) 推荐(1)
[LeetCode] Bitwise AND of Numbers Range 数字范围位相与
摘要： Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive. For example, given the range [5, 阅读全文
posted @ 2015-04-16 11:53 Grandyang 阅读(22220) 评论(8) 推荐(0)
Fork me on GitHub