371.用位运算实现加法 Sum of Two Integers

Posted Long Long Journey

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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.

Subscribe to see which companies asked this question


  1. public class Solution {
  2. public int GetSum(int a, int b) {
  3. int sum = 0;
  4. while (b != 0) {
  5. sum = a ^ b;
  6. b = (a & b) << 1;
  7. a = sum;
  8. }
  9. return sum;
  10. }
  11. }






以上是关于371.用位运算实现加法 Sum of Two Integers的主要内容,如果未能解决你的问题,请参考以下文章

leetcode371. Sum of Two Integers

LeetCode之371. Sum of Two Integers

LeetCode 371 Sum of Two Integers

371. Sum of Two Integers位运算

Leetcode - 371. Sum of Two Integers

LeetCode Q371 Sum of Two Integers(Easy)