||✅✅100% Beats Solution Using Java✅✅ ||Recursion||
Intuition\n Describe your first thoughts on how to solve this problem. \n\n\n\n# Approach\n Describe your approach to solving the problem. \nThis Program is sol
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n![upVoteImage.png](https://assets.leetcode.com/users/images/752573e7-575e-4f90-bf90-f004ba8a354f_1700504018.1703312.png)\n\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nThis Program is solve using Recurssive Approach . If the value of b is -ve then Increase the value of b and decreasethe value of a until the  value of b become 0  when the value of b become zero  the value of a become  the sum of  two  number thenn we return the value of a .\nand Vice Versa . Wish You can easily unnderstand .\n\n# Complexity\n- Time complexity:$$O(n)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:$$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# java\n```\nclass Solution {\n    public int getSum(int a, int b) {\n        /*This is the Base Case  that when \n        the value of b is Zero value of a Become result*/\n        if(b==0) return a;\n        //check that if b value of positive or negetive\n        if(b<0)\n            return getSum(--a,++b);\n        else\n            return getSum(++a,--b);\n    }\n}\n```\n# C++\n```\nclass Solution {\npublic:\n    int getSum(int a, int b) {\n        /*This is the Base Case  that when \n        the value of b is Zero value of a Become result*/\n        if(b==0) return a;\n        //check that if b value of positive or negetive\n        if(b<0)\n            return getSum(--a,++b);\n        else\n            return getSum(++a,--b);\n    }\n};\n```
['Backtracking', 'Recursion', 'C++', 'Java']