摘要：
Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.题目大意：不用乘除取模运算计算两个数的除。解题思路：只能用位运算了，当被除数大于... 阅读全文
摘要：
Given a set of distinct integers,nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not... 阅读全文
摘要：
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu... 阅读全文