cpp-problems/Leetcode2284.cpp at main · Hritik003/cpp-problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
class Solution {
public:
    string largestWordCount(vector<string>& messages, vector<string>& senders) {
        unordered_map< string , int> hash;
        int max =0; string result;
        for(int i=0;i<senders.size();++i)
        {
            int words = length(messages[i]) + 1;
            hash[senders[i]] += words;
            int total = hash[senders[i]];
            if(total > max || (total == max && senders[i]>result))
            {
                max = total;
                result = senders[i];
            }

        }
        return result;


    }

    int length(string s)
     {
    int count=0;
    for(int i=0;s[i]!='\0';++i)
    {
        if(s[i]==' ')
        count++;
    }
    return count;


    }

};