摘要:
Given two 32 bit numbers, N and M, and two bit positions, i and j. Write a method to set all bits between i and j in N equal to M (e g , M becomes a ... 阅读全文
posted @ 2015-09-13 23:30
卖程序的小歪
阅读(393)
评论(0)
推荐(0)
摘要:
Determine the number of bits required to flip if you want to convert integer n to integer m.
Have you met this question in a real interview? Yes
Exam... 阅读全文
posted @ 2015-09-13 22:46
卖程序的小歪
阅读(400)
评论(0)
推荐(0)
摘要:
Given n pieces of wood with length L[i] (integer array). Cut them into small pieces to guarantee you could have equal or more than k pieces with the ... 阅读全文
posted @ 2015-09-13 12:23
卖程序的小歪
阅读(761)
评论(0)
推荐(0)