/*******************************************************************
Copyright(c) 2016, Tyrone Li
All rights reserved.
*******************************************************************/
// 作者:TyroneLi
//
/*
Q1:
不用加减乘除做加法:
输入两个数,去这两个数的和,要求不能使用加减乘除四则运算实现。
S1:
1. 这里考虑使用位运算来实现不用加减乘除做加法。两个数相加时候,当把
他们写成二进制时候,发现两个数加和的结果为等于两个数二进制异或结
果加上两个数的与运算结果。有多少个进位则产生多少次这样的循环累加。
*/
#include <iostream>
#include <cstdlib>
#include <cstdio>
int sumWithBits(int num_1, int num_2)
{
int cnt = 0;
int sum = 0;
do{
sum = num_1 ^ num_2;
cnt = (num_1 & num_2) << 1;
num_1 = sum;
num_2 = cnt;
}while(num_2 != 0);
return sum;
}
void test_1()
{
std::cout << "Test 1" << std::endl;
std::cout << "-1 + -2 = -3, got : " << sumWithBits(-1, -2) << std::endl;
std::cout << "1 + 2 = 3, got : " << sumWithBits(1, 2) << std::endl;
std::cout << "1 + -2 = -1, got : " << sumWithBits(1, -2) << std::endl;
std::cout << "-1 + 2 = 1, got : " << sumWithBits(-1, 2) << std::endl;
std::cout << "0 + -2 = -2, got : " << sumWithBits(0, -2) << std::endl;
std::cout << "0 + 2 = 2, got : " << sumWithBits(0, 2) << std::endl;
}
void test_sumWithBits()
{
test_1();
}
int main(int argc, char**argv)
{
test_sumWithBits();
return 0;
}