【leetcode】 Anagrams

原创 2015年07月08日 15:58:54

代码1:


#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;

class Solution
{
public:
    string fun(vector<string> str)
    {
        string a="";

        map<string,vector<string>>mp;
        cout<<str.size()<<endl;
        for(int i=0;i<str.size();i++)
        {
            string temp=str[i];
            sort(temp.begin(),temp.end());
            mp[temp].push_back(str[i]);
        }
        for(map<string,vector<string>>::iterator iter=mp.begin();iter!=mp.end();iter++)
        {
            if(iter->second.size()>1)
            {
                for(vector<string>::iterator it=iter->second.begin();it!=iter->second.end();it++)
                {
                    a+=*it;
                    a.append(1,',');

                }
            }
        }
        return a;
    }
};


class Solution2
{
public:
    string fun(vector<string> str)
    {
        string a="";

        map<string,int>mp;
        vector<string>ans;
        cout<<str.size()<<endl;
        for(int i=0;i<str.size();i++)
        {
            string temp=str[i];
            sort(temp.begin(),temp.end());
            map<string,int>::iterator iter=mp.find(temp);
            if(iter==mp.end())
            {
                mp[temp]=1;
            }
            else
                mp[temp]++;
        }
        for(int i=0;i<str.size();i++)
        {
            string temp=str[i];
            sort(temp.begin(),temp.end());
            if(mp.find(temp)!=mp.end()&&mp[temp]>1)
            {
                    a+=str[i];
                    a.append(1,',');    
            }
        }
        return a;
    }
};


void main()
{
    Solution solution2;
    string str[5]={" eat","a te","li mk","mil k","tae "};
    vector<string>s(str,str+5);
    string result;
    /*for(int i=0;i<5;i++)
        s.push_back(str[i]);*/
    result=solution2.fun(s);
    //for(vector<string>::iterator iter=result.begin();iter!=result.end();iter++)
        //cout<<*iter<<endl;
    cout<<result;

}

代码2:


#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;


class Solution2
{
public:
    string fun(vector<string> str)
    {
        string a="";

        map<string,int>mp;
        vector<string>ans;
        cout<<str.size()<<endl;
        for(int i=0;i<str.size();i++)
        {
            string temp=str[i];
            sort(temp.begin(),temp.end());
            map<string,int>::iterator iter=mp.find(temp);
            if(iter==mp.end())
            {
                mp[temp]=1;
            }
            else
                mp[temp]++;
        }
        for(int i=0;i<str.size();i++)
        {
            string temp=str[i];
            sort(temp.begin(),temp.end());
            if(mp.find(temp)!=mp.end()&&mp[temp]>1)
            {
                    a+=str[i];
                    a.append(1,',');    
            }
        }
        return a;
    }
};


void main()
{
    Solution solution2;
    string str[5]={" eat","a te","li mk","mil k","tae "};
    vector<string>s(str,str+5);
    string result;
    /*for(int i=0;i<5;i++)
        s.push_back(str[i]);*/
    result=solution2.fun(s);
    //for(vector<string>::iterator iter=result.begin();iter!=result.end();iter++)
        //cout<<*iter<<endl;
    cout<<result;

}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

【LeetCode】49. Group Anagrams

【LeetCode】49. Group Anagrams

Leetcode Find All Anagrams in a String

题意:找到字符串中所有可以重排列得到目标串的字串位置。 思路:记录目标串中各字母出现的次数,枚举字符串中每一个字母。 class Solution { public: Solution(...

leetcode 49. Group Anagrams(哈希,字典序)

题目大意:把一个字符串数组按字母组成的不同分到几个字符串数组,把每个字符串数组按字典序排序 解题方法:先用HashMap类对字符串数组哈希,再把每个字符串数组进行字典序排序 要      点: ...

LeetCode 49. Group Anagrams(分组同构异形词)

原题网址:https://leetcode.com/problems/anagrams/ Given an array of strings, group anagrams together. ...

LeetCode | 49. Group Anagrams

Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", ...

Leetcode 49. Group Anagrams & 242. Valid Anagram

49. Group Anagrams Given an array of strings, group anagrams together. For example, gi...

LeetCode Group Anagrams

题目: Given an array of strings, group anagrams together. For example, given: ["eat", "tea", "tan"...

leetcode题解-49. Group Anagrams

题目:Given an array of strings, group anagrams together.For example, given: [“eat”, “tea”, “tan”, “ate...

LeetCode OJ-49.Group Anagrams

LeetCode OJ-49.Group Anagrams题目描述 Given an array of strings, group anagrams together. For exa...

Anagrams--LeetCode

题目: Given an array of strings, return all groups of strings that are anagrams. Note: All inputs w...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)