49.Group Anagrams同字符词语分组

版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。
本文链接:https://blog.csdn.net/u011599639/article/details/89063241

49.Group Anagrams同字符词语分组

1 描述

Given an array of strings, group anagrams together.

Example:

Input: ["eat", "tea", "tan", "ate", "nat", "bat"],
Output:
[
  ["ate","eat","tea"],
  ["nat","tan"],
  ["bat"]
]

2 思路

  1. 建立hash表,依次取数组中的值存入瞬时变量,然后对变量进行排序,最后将排序后的结果作为key值,原始结果作为value,最后将同一个key值得元素全部取出。

  2. 方法2对方法一中的key值做出了调整,采用26个字符转为key,具体如下

    ​ [a, b, c, d, e, …., t,…,z]

    编码:[1, 0, 0, 0, 1,…, 1,…,0] => eat, tea, ate

    ​ [a, b, c, …, n, …., t,…,z]

    编码:[1, 0, 0,…, 1,…, 1,…,0] => tan, nat

3 C++

  • 方法一
class Solution {
public:
    vector<vector<string>> groupAnagrams(vector<string>& strs) {
        vector<vector<string>> result;
        map<string, vector<string>> anagram;

        for(int i=0; i<strs.size(); i++) {
            string str = strs[i];
            sort(str.begin(), str.end());

            if(anagram.find(str) == anagram.end()) {
                vector<string> item;
                anagram[str] = item;
            }
            anagram[str].push_back(strs[i]);
        }

        map<string, vector<string>>::iterator it;
        for(it = anagram.begin(); it != anagram.end(); it++) {
            result.push_back((*it).second);
        }
        return result;
    }
};
  • 方法二
class Solution {
public:
    vector<vector<string>> groupAnagrams(vector<string>& strs) {
        vector<vector<string>> result;
        map<vector<int>, vector<string>> anagram;

        for(int i=0; i<strs.size(); i++) {
            vector<int> vec;
            str_to_vector(strs[i], vec);

            if(anagram.find(vec) == anagram.end()) {
                vector<string> item;
                anagram[vec] = item;
            }
            anagram[vec].push_back(strs[i]);
        }

        map<vector<int>, vector<string>>::iterator it;
        for(it = anagram.begin(); it != anagram.end(); it++) {
            result.push_back((*it).second);
        }
        return result;
    }
private:
    void str_to_vector(string &str, vector<int> & vec) {
        for(int i=0; i<26; i++) {
            vec.push_back(0);
        }

        for(int i=0; i<str.length(); i++) {
            vec[str[i] - 'a'] ++;
        }
    }
};
展开阅读全文

Anagrams by Stack

09-13

How can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert TROT to TORT:nn[ni i i i o o o oni o i i o o i on]nwhere i stands for Push and o stands for Pop. Your program should, given pairs of words produce sequences of stack operations which convert the first word to the second.nnInputnnThe input will consist of several lines of input. The first line of each pair of input lines is to be considered as a source word (which does not include the end-of-line character). The second line (again, not including the end-of-line character) of each pair is a target word. The end of input is marked by end of file.nnOutputnnFor each input pair, your program should produce a sorted list of valid sequences of i and o which produce the target word from the source word. Each list should be delimited bynn[n]nand the sequences should be printed in "dictionary order". Within each sequence, each i and o is followed by a single space and each sequence is terminated by a new line.nProcessnnA stack is a data storage and retrieval structure permitting two operations:nnPush - to insert an item andnPop - to retrieve the most recently pushed itemnWe will use the symbol i (in) for push and o (out) for pop operations for an initially empty stack of characters. Given an input word, some sequences of push and pop operations are valid in that every character of the word is both pushed and popped, and furthermore, no attempt is ever made to pop the empty stack. For example, if the word FOO is input, then the sequence:nni i o i o o is valid, butni i o is not (it's too short), neither isni i o o o i (there's an illegal pop of an empty stack)nValid sequences yield rearrangements of the letters in an input word. For example, the input word FOO and the sequence i i o i o o produce the anagram OOF. So also would the sequence i i i o o o. You are to write a program to input pairs of words and output all the valid sequences of i and o which will produce the second member of each pair from the first.nnSample InputnnmadamnadammnbahamanbahamanlongnshortnericnricenSample Outputnn[ni i i i o o o i o o ni i i i o o o o i o ni i o i o i o i o o ni i o i o i o o i o n]n[ni o i i i o o i i o o o ni o i i i o o o i o i o ni o i o i o i i i o o o ni o i o i o i o i o i o n]n[n]n[ni i o i o i o o n] 问答

没有更多推荐了,返回首页