Leetcode的一道题

在二进制条件下，异或可以实现没有进位的求和。而进位可以通过按位与&来实现。

class Solution {
    func getSum(_ a: Int, _ b: Int) -> Int {
        //change let to var for operation
        var (x, y) = (a, b)
        repeat {
            let carry = x & y
            x = x ^ y
            y = carry << 1
        } while y != 0
        return x
    }
}

LeetCode 371 Sum of Two Integers
LeetCode 371 Sum of Two Integers ========================...
371. Sum of Two Integers
371. Sum of Two Integers【思路】：位运算 [leetcode] 371. Sum of ...
每日算法之LeetCode167 Two Sum（两个数之和问题
LeetCode 167 Two Sum II Q:Given an array of integers that...
1. Two Sum - LeetCode
1. Two Sum - LeetCode Question Given an array of integers...
371. Sum of Two Integers
https://leetcode.com/problems/sum-of-two-integers/descrip...
371. Sum of Two Integers 两整数之和
链接 https://leetcode-cn.com/problems/sum-of-two-integers/d...
Sum of two Integers
Leetcode的一道题在二进制条件下，异或可以实现没有进位的求和。而进位可以通过按位与&来实现。
[leetcode]Sum of Two Integers
easy难度，倒是没啥难度，只是有点意思 a+b不能用+,-符号思路就是按位算吧，举个例子
[刷题防痴呆] 0371 - 两整数之和 (Sum of Two
题目地址 https://leetcode.com/problems/sum-of-two-integers/[h...
[leetcode] Sum of Two Integers--
Calculate the sum of two integers a and b, but you are no...