【力扣剑指 Offer 64. 求1+2+…+n】位运算+短路思想（Python3）

题目描述

https://leetcode-cn.com/problems/qiu-12n-lcof/

思路题解

位运算，逐位运算

https://leetcode-cn.com/problems/qiu-12n-lcof/solution/qiu-12n-by-leetcode-solution/

class Solution:
    def sumNums(self, n: int) -> int:
        a,b=n,n+1
        ans=0
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        ans=ans+(a)*(b&1)
        a<<=1
        b>>=1
        return ans>>1

短路思想

https://leetcode-cn.com/submissions/detail/200346446/

class Solution:
    def sumNums(self, n: int) -> int:
        # print(n)
        return (n>0)and(n+self.sumNums(n-1))