HackerRank "The Great XOR"

转载于 2017-05-12 12:43:00 发布 · 139 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/tonix/p/6845021.html

文章标签：

#开发工具

本文通过一种离散思考策略对比了HackerRank与LeetCode的问题解决方式，提出了一种观察并逐位分析的方法来解决特定类型的编程挑战。通过一个具体的Python实现案例，展示了如何检查数字的二进制表示，并利用XOR操作来解决问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Hey I found problems on HackerRank is more interesting than ones on LeetCode..

Strategy: observe\analyze bit by bit - DISCRETE THINKING. The idea is like this: if we can XOR any bit in original number X to make that bit into 1 from 0, then any bits following that bit don't matter; and we go check bit by bit. This is also the sln in editorial.

t = int(raw_input())

for i in xrange(t):
    n = int(raw_input())
    j = 0
    cnt = 0
    
    while n > 0:
        if (n&1) == 0:
            cnt += pow(2, j)
        j += 1
        n >>= 1
    print cnt