Add Digits

 https://leetcode.com/problems/add-digits/

 

class Solution {
public:
    int addDigits(int num) {
        if(num%9 == 0 && num!=0)
        return 9;
        return (num%9);
    }
};

Comments

Post a Comment

Popular posts from this blog

Contains Duplicate II

 https://leetcode.com/problems/contains-duplicate-ii/ class Solution { public:     bool containsNearbyDuplicate(vector<int>& nums, int k) {         unordered_map<int,int>m;         for(int i=0;i<nums.size();i++){             if(m.count(nums[i])){                 int diff=abs(i-m[nums[i]]);                 if(diff<=k){                     return true;                 }             }             m[nums[...
Read more

Is Rectangle?

 https://www.interviewbit.com/old/problems/is-rectangle/ int Solution::solve(int A, int B, int C, int D) {      if (((A==B)&&(C==D))||((A==C)&&(B==D))||((A==D)&&(B==C))){         return 1;     }else{         return 0;     } }  
Read more

Valid Anagram

 https://leetcode.com/problems/valid-anagram/   class Solution { public:     bool isAnagram(string s, string t) {       if(s.length()!=t.length()){           return false;       }         int n=s.length();         unordered_map<char,int>m;         for(int i=0;i<n;i++){             m[s[i]]++;             m[t[i]]--;         }         for(auto j : m){             if(j.second){                 return false;         ...
Read more