LeetCode: 371. Sum of Two Integers

最新推荐文章于 2024-09-15 22:24:30 发布

qha0731

最新推荐文章于 2024-09-15 22:24:30 发布

阅读量221

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/qha0731/article/details/74745018

版权

LeetCode 专栏收录该内容

35 篇文章 0 订阅

订阅专栏

LeetCode: 371. Sum of Two Integers

Calculate the sum of two integers a and b, but you are not allowed to
use the operator + and -.

Example: Given a = 1 and b = 2, return 3.

Credits: Special thanks to @fujiaozhu for adding this problem and
creating all test cases.

自己的答案，0ms：

public class Solution {
    public int getSum(int a, int b) {
        if (b == 0) {
            return a;
        }
        int xor = a ^ b;
        int and = (a & b) << 1;
        return getSum(xor, and);
    }
}

最快的答案，0ms：

public class Solution {
    public int getSum(int a, int b) {
        while (b != 0){
            int carry = a & b; // common bits of a and b

            a = a ^ b; // sum

            b = carry << 1; // shift one bit to the left
        }

        return a;
    }
}