package com.lintcode; /** * 1. A + B é®é¢ * ç»åºä¸¤ä¸ªæ´æ°aåb, æ±ä»ä»¬çå, ä½ä¸è½ä½¿ç¨ + çæ°å¦è¿ç®ç¬¦ã * * ææï¼æ¾ç¶ä½ å¯ä»¥ç´æ¥ return a + bï¼ä½æ¯ä½ æ¯å¦å¯ä»¥ææä¸ä¸ä¸è¿æ ·åï¼ */ public class Solution1 { /** * @param a: An integer * @param b: An integer * @return: The sum of a and b */ public int aplusb(int a, int b) { // write your code here if (a == 0) { return b; } if (b == 0){ return a; } int c = a ^ b; int d = (a & b)<<1; return aplusb(c, d); } }