carloscn
commented
1 year ago Analysis
pub fn make_equal(words: Vec<&str>) -> bool
{
let len = words.len();
if len < 2 {
return true;
}
let mut rom:Vec<i32> = vec![0; 26];
for e in words {
let t_vec:Vec<char> = e.chars().collect();
for k in t_vec {
rom[k as usize - 'a' as usize] += 1;
}
}
for e in rom {
if e as usize % len != 0 {
return false;
}
}
return true;
}
Description
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' in words[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 return true.
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.