LeetCode 371. Sum of Two Integers
来源:互联网 发布:淘宝客导购网站有哪些 编辑:程序博客网 时间:2024/06/05 19:07
原题:
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.
题意:
计算两个整数a和b的和,但是你不允许使用操作符+和-。
例子:
给定a=1和b=2,返回3。
思路:
利用两个整数相与(&)、异或(^)的的性质,即可得到所求。
代码:
public class Solution { public int getSum(int a, int b) { if(a == 0){ return b; } if(b == 0){ return a; } while(b != 0){ int carry = a & b; a ^= b; b = carry << 1; } return a; }}
0 0
- LeetCode 371. Sum of Two Integers
- 371. Sum of Two Integers LeetCode OJ
- [Leetcode]371. Sum of Two Integers
- LeetCode - 371. Sum of Two Integers
- <LeetCode OJ> 371. Sum of Two Integers
- LeetCode 371. Sum of Two Integers
- leetcode 371. Sum of Two Integers
- leetcode 371.Sum of Two Integers
- LeetCode 371. Sum of Two Integers
- 371. Sum of Two Integers(Leetcode)
- leetcode 371. Sum of Two Integers
- 【leetcode】371. Sum of Two Integers【E】
- [leetcode] 371. Sum of Two Integers
- leetcode.371. Sum of Two Integers
- 371. Sum of Two Integers--LeetCode Record
- LeetCode—371. Sum of Two Integers
- Leetcode 371. Sum of Two Integers
- LeetCode 371. Sum of Two Integers
- 下载chrome离线安装程序的方法
- leetcode 39. Combination Sum
- 【WordPress头条】你不得不看的国产wp主题精选推荐
- Eclipse4.X版本安装ECLIPSE 打包插件fatjar
- parseInt函数
- LeetCode 371. Sum of Two Integers
- Codeforces Round #395 (Div. 2) D. Timofey and rectangles
- 最简单的Ogre系列之二——画线
- unity中屏幕和世界坐标系区别
- Codeforces 764C或763A Timofey and a tree 【好题】
- GRUB启动分析之stage1
- Java细粒度锁实现的3种方式
- Centos7 ifconfig这个命令没找到的解决方法
- Codeforces Round #395 (Div. 2)D. Timofey and rectangles