这里给出递归和非递归实现
//不适用加减乘除实现加法操作
int Sum(int num1,int num2){
int sum,carry;
do{
sum=num1^num2;
array=(num1&num2)<<1;
num1=sum;
num2=carry;
}while(num2!=0);
return sum;
}
int Sum(int num1,int num2){
if(num2==0) return num1;
int sum=num1^num2;
int carry=(num1&num2)<<1;
return Sum(sum,carry);
}