leecode 157. Unique Characters

leecode 157. Unique Characters

实现一个算法确定字符串中的字符是否均唯一出现

        样例 1:
        输入:  "abc_____"
        输出:  false
      
        样例 2：  
        输入:  "abc"
        输出:  true

idea:判断该字符是否出现过，故用一个数组或者map标记，遍历数组，如果该数组没出现过，在标记数组或者map中存储，否则返回False

python:

class Solution:
    """
    @param: str: A string
    @return: a boolean
    """
    def isUnique(self, str):
        # write your code here
        solve_idea={}
        for each in str:
            if each in solve_idea.keys():
                return False
            else:
                solve_idea[each]=1
        return True




class Solution:
    """
    @param: str: A string
    @return: a boolean
    """
    def isUnique(self, str):
        # write your code here
        solve_idea=[]
        for each in str:
            if each in solve_idea
                return False
            else:
                solve_idea.append(each)
        return True