You are given an array of strings words
(0-indexed).
In one operation, pick two distinct indices i
and j
, where words[i]
is a non-empty string, and move any character from words[i]
to any position in words[j]
.
Return true
if you can make every string in words
equal using any number of operations, and false
otherwise.
Example 1:
Input: words = ["abc","aabc","bc"] Output: true Explanation: Move the first 'a' inwords[1] to the front of words[2], to make
words[1]
= "abc" and words[2] = "abc". All the strings are now equal to "abc", so returntrue
.
Example 2:
Input: words = ["ab","a"] Output: false Explanation: It is impossible to make all the strings equal using the operation.
Constraints:
1 <= words.length <= 100
1 <= words[i].length <= 100
words[i]
consists of lowercase English letters.
Companies:
Moengage
Related Topics:
String, Greedy
// OJ: https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(1)
class Solution {
public:
bool makeEqual(vector<string>& A) {
int cnt[26] = {};
for (auto &s : A) {
for (char c : s) cnt[c - 'a']++;
}
for (int i = 0; i < 26; ++i) {
if (cnt[i] % A.size()) return false;
}
return true;
}
};