位操作
文章平均质量分 79
sscssz
这个作者很懒,什么都没留下…
展开
-
【VIP】342. Power of Four 【E】【leetcode】
Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example: Given num = 16, return true. Given num = 5, return false. Follow up: Could you solve it without原创 2016-04-19 14:49:47 · 373 阅读 · 0 评论 -
【leetcode】371. Sum of Two Integers【E】
Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. Example: Given a = 1 and b = 2, return 3. Credits: Special thanks to @fujiaozhu for adding thi原创 2016-07-05 14:08:25 · 1238 阅读 · 1 评论 -
401. Binary Watch【E】
A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59). Each LED represents a zero or one, with the least significant bit o原创 2016-11-05 19:49:04 · 413 阅读 · 0 评论