g0001_0100.s0049_group_anagrams.Solution.rs Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #String #Hash_Table #Sorting
// #Data_Structure_II_Day_8_String #Programming_Skills_II_Day_11 #Udemy_Strings
// #Big_O_Time_O(n*k_log_k)_Space_O(n) #2024_09_06_Time_0_ms_(100.00%)_Space_5.3_MB_(26.81%)

use std::collections::HashMap;

impl Solution {
    pub fn group_anagrams(strs: Vec) -> Vec> {
        let mut hm: HashMap> = HashMap::new();

        for s in strs.iter() {
            let mut ch: Vec = s.chars().collect();
            ch.sort_unstable();
            let temp: String = ch.iter().collect();

            hm.entry(temp).or_insert_with(Vec::new).push(s.clone());
        }

        hm.into_values().collect()
    }
}