给出一个字符串,找出第一个只出现一次的字符。
python:
class Solution: """ @param str: str: the given string @return: char: the first unique character in a given string """ def firstUniqChar(self, str): # Write your code here for i in range(len(str)): count = 0 for j in range(len(str)): if str[i] == str[j]: count += 1 if count > 1: break if count == 1: return str[i]C++:
class Solution { public: /** * @param str: str: the given string * @return: char: the first unique character in a given string */ char firstUniqChar(string &str) { // Write your code here for(int i = 0; i< str.size(); i++) { int count = 0; for(int j = 0; j < str.size(); j++) { if(str[i] == str[j]) { count++; } if(count > 1) { break; } } if (count == 1) { return str[i]; } } } };