leetcode每日一题第二十九天

class Solution {
public:
    bool isUnique(string astr) {
        map<char,char>maps;
        int n = astr.size();
        for(int i=0;i<n;i++)
        {
            if(!maps.count(astr[i]))
            {
                maps[astr[i]] = astr[i];
            }
            else
            {
                return false;
            }
        }
        return true;
    }
};