371. 两整数之和 - 力扣(LeetCode) (leetcode-cn.com)
class Solution {
public int getSum(int a, int b) {
while (b != 0) {
int carry = (a & b) << 1;
a = a ^ b;
b = carry;
}
return a;
}
}

371. 两整数之和 - 力扣(LeetCode) (leetcode-cn.com)
class Solution {
public int getSum(int a, int b) {
while (b != 0) {
int carry = (a & b) << 1;
a = a ^ b;
b = carry;
}
return a;
}
}