leetcode371. Sum of Two Integers
来源:互联网 发布:韩国护肤品推荐知乎 编辑:程序博客网 时间:2024/06/15 10:01
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.
解法
关于bit操作的详细总结如下:
https://leetcode.com/problems/sum-of-two-integers/#/solutions
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 = a ^ b; b = carry << 1; } return a; }}
1 0
- leetcode371. sum of two integers
- leetcode371-----Sum of Two Integers
- Leetcode371: Sum of Two Integers
- Leetcode371.Sum of Two Integers
- leetcode371:Sum of Two Integers
- leetcode371. Sum of Two Integers
- leetcode371. Sum of Two Integers
- LeetCode371. Sum of Two Integers
- LeetCode371——Sum of Two Integers(不用+)
- leetcode371: Sum of 2 Integers
- Sum of Two Integers
- Sum of Two Integers
- Sum of Two Integers
- Sum of Two Integers
- Sum of Two Integers
- Sum of Two Integers
- sum of two integers
- Sum of Two Integers
- 传统tcp网络编程入门示例
- Linux内核2.4.18创建硬链接的系统调用sys_link
- 【Java学习笔记】01.Java新天地,第一行代码
- hdu 4521 小明序列
- maven中properties标签定义变量
- leetcode371. Sum of Two Integers
- spring mvc依赖jar以及源码下载
- 在window操作系统下设置域名解析器
- hadoop安装教程
- 数列分段
- 算法训练 奇偶判断
- java一个项目中引用另一个项目的方法
- lamper技能树
- nginx发起http请求 使用cosocket