这篇博客介绍了HDU 1196题目，即找出整数的二进制表示中最低位的1，并提供了两种解决方案，包括基础代码实现和优化后的代码展示。
Lowest Bit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10560 Accepted Submission(s): 7751
Problem Description
Given an positive integer A (1 <= A <= 100), output the lowest bit of A.
For example, given A = 26, we can write A in binary form as 11010, so the lowest bit of A is 10, so the output should be 2.
Another example goes like this: given A = 88, we can write A in binary form as 1011000, so the lowest bit of A is 1000, so the output should be 8.
For example, given A = 26, we can write A in binary form as 11010, so the lowest bit of A is 10, so the output should be 2.
Another example goes like this: given A = 88, we can write A in binary form as 1011000, so the lowest bit of A is 1000, so the output should be 8.
最低0.47元/天 解锁文章
扫一扫
629
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
