Skip to main content

Leetcode 371. Sum of Two Integers. C++ / Java

371. Sum of Two Integers 


Given two integers a and b, return the sum of the two integers without using the operators + and -.

 

Example 1:

Input: a = 1, b = 2
Output: 3

Example 2:

Input: a = 2, b = 3
Output: 5

 

Constraints:

  • -1000 <= a, b <= 1000



Solution : 

C++ :

class Solution {
public:
    int getSum(int a, int b) {
        if (b==0) return a;
        int sum = a ^ b;
        int cr = (unsigned int) (a & b) << 1;
        return getSum(sum, cr);
        
        
    }
};


Java : 

class Solution {
    public int getSum(int a, int b) {
                while(b != 0){
        int tmp = (a & b) << 1;
        a = a ^ b;
        b = tmp;
    }
    return a;
    }
}


Explaination :






Comments

Popular posts from this blog

May-6 2020 Challenge

  6.   Majority Element Given an array of size  n , find the majority element. The majority element is the element that appears  more than   ⌊ n/2 ⌋  times. You may assume that the array is non-empty and the majority element always exist in the array. Example 1: Input: [3,2,3] Output: 3 Example 2: Input: [2,2,1,1,1,2,2] Output: 2 Solution in Java  class Solution {     public int majorityElement(int[] num) {         int m = num[0], cnt= 1;     for (int i = 1; i < num.length; i++) {         if (cnt == 0) {             m= num[i];             cnt = 1;         } else if (num[i] == m) {             cnt++;         } else              cnt--;    }      return m;...

Leetcode 190. Reverse Bits. Python. Bit Manipulation

  190 .  Reverse Bits Reverse bits of a given 32 bits unsigned integer. Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, both input and output will be given as a signed integer type. They should not affect your implementation, as the integer's internal binary representation is the same, whether it is signed or unsigned. In Java, the compiler represents the signed integers using  2's complement notation . Therefore, in  Example 2  above, the input represents the signed integer  -3  and the output represents the signed integer  -1073741825 .   Example 1: Input: n = 00000010100101000001111010011100 Output: 964176192 (00111001011110000010100101000000) Explanation: The input binary string 00000010100101000001111010011100 represents the unsigned integer 43261596, so return 964176192 which its binary representation is 00111001011110000010100101000000 . Example 2: Input: n = 11111111111111111111...

Leetcode 212. Word Search II. Python (TrieNode/Prefix Tree)

  212 .  Word Search II Given an  m x n   board  of characters and a list of strings  words , return  all words on the board . Each word must be constructed from letters of sequentially adjacent cells, where  adjacent cells  are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word. Input: board = [["o","a","a","n"],["e","t","a","e"],["i","h","k","r"],["i","f","l","v"]], words = ["oath","pea","eat","rain"] Output: ["eat","oath"] Constraints: m == board.length n == board[i].length 1 <= m, n <= 12 board[i][j]  is a lowercase English letter. 1 <= words.length <= 3 * 10 4 1 <= words[i].length <= 10 words[i]  consists of lowercase English letters. All the strings of  words  are unique. class TrieNode: de...