Cho một chuỗi, tìm ký tự không lặp lại đầu tiên trong đó. Ví dụ: nếu chuỗi đầu vào là Geeksforgeeks, thì đầu ra phải là ‘F, và nếu chuỗi đầu vào là Geeksquiz, thì đầu ra phải là‘ g, & nbsp;
Example:
Input: "geeksforgeeks" Explanation: Step 1: Construct a character count array from the input string. .... count['e'] = 4 count['f'] = 1 count['g'] = 2 count['k'] = 2 …… Step 2: Get the first character who's count is 1 ('f').Phương pháp số 1: & NBSP; Hashmap và hai chuỗi truyền qua.HashMap and Two-string method traversals.
Một ký tự được cho là không lặp lại nếu tần số của nó trong chuỗi là đơn vị. Bây giờ để tìm các ký tự như vậy, người ta cần tìm tần số của tất cả các ký tự trong chuỗi và kiểm tra ký tự nào có tần số đơn vị. Nhiệm vụ này có thể được thực hiện một cách hiệu quả bằng cách sử dụng Hash_map sẽ ánh xạ ký tự đến các tần số tương ứng và trong đó chúng ta có thể cập nhật đồng thời tần số của bất kỳ ký tự nào chúng ta gặp trong thời gian không đổi. Các ký tự khác biệt tối đa trong hệ thống ASCII là 256. Vì vậy, Hash_map có kích thước tối đa là 256. Bây giờ hãy đọc lại chuỗi và ký tự đầu tiên mà chúng ta tìm thấy có tần số vì sự thống nhất là câu trả lời. & NBSP;unit frequency. This task could be done efficiently using a hash_map which will map the character to there respective frequencies and in which we can simultaneously update the frequency of any character we come across in constant time. The maximum distinct characters in the ASCII system are 256. So hash_map has a maximum size of 256. Now read the string again and the first character which we find has a frequency as unity is the answer.
Algorithm:
- Tạo một hash_map sẽ ánh xạ ký tự đến tần số tương ứng.hash_map which will map the character to there respective frequencies.
- Traverse Chuỗi đã cho bằng một con trỏ.
- Tăng số lượng ký tự hiện tại trong Hash_Map.hash_map.
- Bây giờ hãy đi qua chuỗi một lần nữa và kiểm tra xem ký tự hiện tại HasFrequency = 1.frequency=1.
- Nếu tần số> 1 tiếp tục truyền tải.frequency>1 continue the traversal.
- Khác phá vỡ vòng lặp và in ký tự hiện tại là câu trả lời.break the loop and print the current character as the answer.
Mã giả: & nbsp;
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]Dưới đây là việc thực hiện phương pháp trên:
C++
#include <iostream>
using namespace for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]0
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]5
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]9for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2First non-repeating character is f1First non-repeating character is f2First non-repeating character is f3First non-repeating character is f4First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2First non-repeating character is f7
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res0
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res3
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res5
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res8
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f1for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]5
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2First non-repeating character is f7
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f0
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5 First non-repeating character is f6
First non-repeating character is f7First non-repeating character is f8
First non-repeating character is f7First non-repeating character is f0First non-repeating character is f1
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f7First non-repeating character is f8
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 #include <iostream>1
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 #include <iostream>4
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4 #include <iostream>8#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 using3
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5 using6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4using8using9
First non-repeating character is f7namespace1First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7namespace4
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4using8namespace7namespace8
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]00
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]02for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]03
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]06
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
C
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]08
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]09
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]5
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]9for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2First non-repeating character is f1First non-repeating character is f2First non-repeating character is f3First non-repeating character is f4First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2First non-repeating character is f7
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res0
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res3
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res5
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res8
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f1for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]5
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2First non-repeating character is f7
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f0
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5 First non-repeating character is f6
First non-repeating character is f7First non-repeating character is f8
First non-repeating character is f7First non-repeating character is f0First non-repeating character is f1
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f7First non-repeating character is f8
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 #include <iostream>1
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 #include <iostream>4
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4 #include <iostream>8#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 using3
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5 using6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]87First non-repeating character is f3using9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]90namespace1for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]92
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7namespace4
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]87First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]98for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]99
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]90First non-repeating character is f01
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]02for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]03
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]06
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
C
Java
First non-repeating character is f09 First non-repeating character is f10
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f12 First non-repeating character is f13 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f15First non-repeating character is f16First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f12 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4 First non-repeating character is f21First non-repeating character is f22 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4First non-repeating character is f224
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f12 First non-repeating character is f27 First non-repeating character is f28
First non-repeating character is f7First non-repeating character is f39
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f35First non-repeating character is f36First non-repeating character is f37
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f49
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f12 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f45
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f52First non-repeating character is f53First non-repeating character is f54
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f57First non-repeating character is f36First non-repeating character is f59
First non-repeating character is f65First non-repeating character is f8
First non-repeating character is f65First non-repeating character is f0First non-repeating character is f1
First non-repeating character is f7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
First non-repeating character is f7First non-repeating character is f5 First non-repeating character is f62First non-repeating character is f53First non-repeating character is f64
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 #include <iostream>1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f87#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f80 First non-repeating character is f12 First non-repeating character is f27 First non-repeating character is f83
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f94
First non-repeating character is f7First non-repeating character is f96First non-repeating character is f53
First non-repeating character is f65First non-repeating character is f99for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res00
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res01for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res02for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res03
First non-repeating character is f65for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res05namespace7
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res01for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res08
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
Python3
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res12for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 First non-repeating character is f16
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res15 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res16
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res18for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res20First non-repeating character is f36for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res222323 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res24
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res27for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res28 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res29
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res31for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res32___
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res39
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res15 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res41
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res18for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res45
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res47for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res49First non-repeating character is f53
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res52for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 First non-repeating character is f36
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res27for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res28 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res29
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res31for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res32___
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res39
First non-repeating character is f7First non-repeating character is f0
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res15 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res41
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res18for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res45
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res47for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res49First non-repeating character is f53
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res52for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 First non-repeating character is f36
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res31for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res32for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res64for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 First non-repeating character is f53__
First non-repeating character is f7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res47for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res72
namespace4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res68
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res522____334for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 First non-repeating character is f53
C#
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res82
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res83for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 #include <iostream>9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res47for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res88
First non-repeating character is f5 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res47for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 First non-repeating character is f53for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res68
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res96 First non-repeating character is f3for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res98for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res99
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res96 First non-repeating character is f3First non-repeating character is f05 First non-repeating character is f06
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
using First non-repeating character is f08
First non-repeating character is f7First non-repeating character is f38
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
using First non-repeating character is f10
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f49
First non-repeating character is f09 First non-repeating character is f10
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f12 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f16
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f12 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4First non-repeating character is f20First non-repeating character is f22 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4First non-repeating character is f24
First non-repeating character is f65First non-repeating character is f8
First non-repeating character is f65First non-repeating character is f0First non-repeating character is f1
First non-repeating character is f7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f12 First non-repeating character is f27 First non-repeating character is f27First non-repeating character is f28 First non-repeating character is f29
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f36
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f12 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f1First non-repeating character is f28 First non-repeating character is f29
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f0
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f90First non-repeating character is f91
First non-repeating character is f92for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res02First non-repeating character is f94
First non-repeating character is f92for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res02for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res03
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f56
First non-repeating character is f7First non-repeating character is f5 First non-repeating character is f59
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 #include <iostream>1
First non-repeating character is f08
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f80 First non-repeating character is f12 First non-repeating character is f27 First non-repeating character is f78
First non-repeating character is f11for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13First non-repeating character is f13First non-repeating character is f14
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f28 First non-repeating character is f83#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 using3
First non-repeating character is f98for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res05First non-repeating character is f00
First non-repeating character is f92for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res02250503 First non-repeating character is f04
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f11First non-repeating character is f40First non-repeating character is f17for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res20First non-repeating character is f27First non-repeating character is f44
PHP
First non-repeating character is f09 First non-repeating character is f10
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 using3
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f27First non-repeating character is f17for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]92
First non-repeating character is f98for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res05First non-repeating character is f00
First non-repeating character is f98for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res05First non-repeating character is f00
First non-repeating character is f92for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res02250503 First non-repeating character is f04
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
PHP
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
First non-repeating character is f09 First non-repeating character is f10
First non-repeating character is f15 First non-repeating character is f27First non-repeating character is f17for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res99
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f21 First non-repeating character is f11First non-repeating character is f1
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3First non-repeating character is f27 First non-repeating character is f28
First non-repeating character is f29First non-repeating character is f27 First non-repeating character is f31First non-repeating character is f32First non-repeating character is f3First non-repeating character is f17First non-repeating character is f35First non-repeating character is f27__
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
First non-repeating character is f15 First non-repeating character is f1First non-repeating character is f17for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res99
First non-repeating character is f20First non-repeating character is f21First non-repeating character is f1
namespace4
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f60 First non-repeating character is f61
First non-repeating character is f7First non-repeating character is f28First non-repeating character is f19
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]90First non-repeating character is f17for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res20First non-repeating character is f60First non-repeating character is f34
First non-repeating character is f35
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5 First non-repeating character is f3First non-repeating character is f11First non-repeating character is f40____517for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res20First non-repeating character is f27First non-repeating character is f86
First non-repeating character is fFirst non-repeating character is f7First non-repeating character is f60 First non-repeating character is f91First non-repeating character is f27First non-repeating character is f1
The above approach takes O(n) time, but in practice, it can be improved. The first part of the algorithm runs through the string to construct the count array (in O(n) time). This is reasonable. But the second part about running through the string again just to find the first non-repeater is not a good practice.
In real situations, the string is expected to be much larger than your alphabet. Take
DNA sequences, for example, they could be millions of letters long with an alphabet of just 4 letters. What happens if the non-repeater is at the end of the string? Then we would have to scan for a long time (again).
First non-repeating character is f7First non-repeating character is f0First non-repeating character is f1HashMap and single string traversal
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 First non-repeating character is f60First non-repeating character is f1e.g. (3, 26) for ‘a’ meaning that ‘a’ got counted 3 times and the first time it was seen is at position 26. So when it comes to finding the first non-repeater, we just have to scan the count array, instead of the string. Thanks to Ben for suggesting this approach.
Thuật toán: & nbsp;
- Tạo một Count_array sẽ có hai trường là tần số, lần đầu tiên xuất hiện của một ký tự.count_array which will have two fields namely frequency, first occurrence of a character.
- Kích thước của Count_array là ‘256.count_array is ‘256’.
- Traverse Chuỗi đã cho bằng một con trỏ.
- Tăng số lượng ký tự hiện tại và cập nhật sự xuất hiện.
- Bây giờ, ở đây, một sản phẩm bắt, mảng sẽ chứa sự xuất hiện đầu tiên hợp lệ của nhân vật có tần số có sự thống nhất nếu không lần xuất hiện đầu tiên tiếp tục cập nhật.
- Bây giờ đi qua Count_array và tìm ký tự có giá trị ít nhất của sự xuất hiện và giá trị tần số đầu tiên là thống nhất.least value of first occurrence and frequency value as unity.
- Trả lại nhân vật
Mã giả: & nbsp;
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return resImplementation:
C++
First non-repeating character is f36
using namespace for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]0
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f1for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]5
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f47for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2First non-repeating character is f49for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2First non-repeating character is f51
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f56
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f58
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f60
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f65
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f70
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5 First non-repeating character is f73
First non-repeating character is f7First non-repeating character is f75
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 First non-repeating character is f78
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 #include <iostream>4
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4 #include <iostream>8#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 using3
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5 First non-repeating character is f93
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]87First non-repeating character is f3First non-repeating character is f97
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]90First non-repeating character is f99for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]92
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7namespace4
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]87First non-repeating character is f3First non-repeating character is f00
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]90#include <iostream>08for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]99
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]90First non-repeating character is f01
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]06
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
C
#include <iostream>16
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]08
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]09
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]1
#include <iostream>20 #include <iostream>21
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res8
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 #include <iostream>1
#include <iostream>28
#include <iostream>20 #include <iostream>30for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]5
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7#include <iostream>20 #include <iostream>36#include <iostream>20 #include <iostream>38First non-repeating character is f2223
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f4First non-repeating character is f3#include <iostream>20 #include <iostream>45
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res0
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4#include <iostream>53
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5 #include <iostream>56
First non-repeating character is f7#include <iostream>58
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res8
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f1for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]5
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f56
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4#include <iostream>74
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f65
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f70
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5 First non-repeating character is f73
First non-repeating character is f7#include <iostream>85
First non-repeating character is f7#include <iostream>87
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f7First non-repeating character is f8
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 First non-repeating character is f78
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 #include <iostream>4
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4 #include <iostream>8#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 using3
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5 First non-repeating character is f93
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]87First non-repeating character is f3First non-repeating character is f18
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]90First non-repeating character is f21for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]92
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7namespace4
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]87First non-repeating character is f3First non-repeating character is f00
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]90#include <iostream>08for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]99
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]90First non-repeating character is f01
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]02for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]03
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]06
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
C
#include <iostream>20 #include <iostream>21
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res8
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 #include <iostream>1
#include <iostream>20 #include <iostream>30for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]5
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4using51using52First non-repeating character is f53First non-repeating character is f1
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4using51using57
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7#include <iostream>20 #include <iostream>36#include <iostream>20 #include <iostream>38First non-repeating character is f2223
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4using51using68
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f4First non-repeating character is f3#include <iostream>20 #include <iostream>45
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res0
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5 #include <iostream>56
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res8
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7#include <iostream>20 #include <iostream>72
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 #include <iostream>77
First non-repeating character is f65namespace05
First non-repeating character is f7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 #include <iostream>80
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5 #include <iostream>83
First non-repeating character is f7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 #include <iostream>95
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f49
Java
using36 using37
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
First non-repeating character is f09 using39
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 using42
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f80 using45for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 using47
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
First non-repeating character is f65namespace51
First non-repeating character is f7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f80 First non-repeating character is f27 using63
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
First non-repeating character is f09 First non-repeating character is f10
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f12 First non-repeating character is f13 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f15First non-repeating character is f16First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f12 using83
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f94
First non-repeating character is f7namespace78
First non-repeating character is f65First non-repeating character is f99namespace81
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res01for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res02namespace84
First non-repeating character is f65for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res05namespace7
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res01for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res08
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
Python3
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f91First non-repeating character is f22 using87
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f12 First non-repeating character is f27 First non-repeating character is f28
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f35First non-repeating character is f36First non-repeating character is f59
First non-repeating character is f7First non-repeating character is f5 namespace03
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res27for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res28 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]009for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]016
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]018for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res20First non-repeating character is f36for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]99First non-repeating character is f36for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]024
Is
Các
Các
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]057for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]059
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res27for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res28 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]009for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]016
Các
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]057for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]078for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]079First non-repeating character is f53for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]081
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]084
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]000 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 #include <iostream>9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res47for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 First non-repeating character is f1____for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]000for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res99
First non-repeating character is f5 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]094for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]097
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res96First non-repeating character is f3for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res98for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res99
namespace4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res68
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res96First non-repeating character is f3namespace7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]99for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]000for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]111
C#
using First non-repeating character is f08
using for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]115
First non-repeating character is f09 using39
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f80 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 using42
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f80 using45for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 using47
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4using51for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]131
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4using51using57
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f80 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]139 First non-repeating character is f27 using63
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4using51using68
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
First non-repeating character is f09 First non-repeating character is f10
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f80 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]154 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f16
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f80 First non-repeating character is f12 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]160for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]99
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]163for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]164
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]166First non-repeating character is f22 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]160for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]99
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]171for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]172
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f80 First non-repeating character is f12 First non-repeating character is f27 First non-repeating character is f27First non-repeating character is f28 First non-repeating character is f29
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]186
First non-repeating character is f7First non-repeating character is f5 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]189
First non-repeating character is f65for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]191
First non-repeating character is f7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
First non-repeating character is f7namespace4 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
First non-repeating character is f65for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]198First non-repeating character is f22 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]200
First non-repeating character is f7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]208 First non-repeating character is f12 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f1First non-repeating character is f28 First non-repeating character is f29
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f49
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]220for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]222
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f56
First non-repeating character is f7First non-repeating character is f5 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]228
First non-repeating character is f65for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]230
First non-repeating character is f7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 #include <iostream>95
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f80 First non-repeating character is f12 First non-repeating character is f27 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]244First non-repeating character is f28for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]246
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f28 First non-repeating character is f83#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 using3
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]258
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]260for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]262
First non-repeating character is f65First non-repeating character is f99namespace81
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res01for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res02namespace84
First non-repeating character is f65for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res05namespace7
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res01First non-repeating character is f04
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
JavaScript
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]277
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]278
First non-repeating character is f15 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]280
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]283First non-repeating character is f22 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]285
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]288
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]290
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]295
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]297
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]299
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]303
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]306
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]309
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]311
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 First non-repeating character is f78
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]316#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]319
First non-repeating character is f5 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]321
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]323for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res98for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]92
namespace4
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]323namespace7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]330
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]331
Đầu ra
First non-repeating character is fPhân tích độ phức tạp: & NBSP;
- Độ phức tạp về thời gian: o (n). & Nbsp; vì chuỗi cần phải được đi qua tại địa điểm một lần. O(n).
As the string need to be traversed at-least once. - Không gian phụ trợ: O (1). & NBSP; Không gian bị chiếm bởi việc sử dụng Count_array/Hash_map để theo dõi tần số. O(1).
Space is occupied by the use of count_array/hash_map to keep track of frequency.
Phương pháp số 3: Đếm mảng và chuỗi chuỗi đơn:
Cách tiếp cận: Tạo một mảng đếm số lượng ký tự tối đa (256). Chúng ta có thể khởi tạo tất cả các yếu tố trong mảng này thành -1. Và sau đó lặp qua ký tự chuỗi của chúng tôi theo ký tự và kiểm tra xem phần tử mảng có ký tự này là chỉ mục là -1 hay không. Nếu đó là -1 thì hãy thay đổi nó thành I và nếu không -1 thì điều này có nghĩa là ký tự này đã xuất hiện trước đó, vì vậy hãy thay đổi nó thành -2. & NBSP;Make a count array of maximum number of characters(256). We can initialize all the elements in this array to -1. And then loop through our string character by character and check if the array element with this character as index is -1 or not. If it is -1 then change it to i and if it not -1 then this means that this character already appeared before, so change it to -2.
Cuối cùng, tất cả các ký tự lặp lại sẽ được thay đổi thành -2 và tất cả các ký tự không lặp lại sẽ chứa chỉ mục nơi chúng xảy ra. Bây giờ chúng ta chỉ có thể lặp qua tất cả các ký tự không lặp lại và tìm chỉ mục tối thiểu hoặc chỉ mục đầu tiên.
Implementation:
C++
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]332
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]333
using namespace for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]0
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]338
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]341
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]346
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]348
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]353
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]356
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]358
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9namespace4 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]364
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f65
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]376
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]379
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]381
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]386for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]388
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7namespace4 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 First non-repeating character is f78
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]395
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]397
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]398First non-repeating character is f83#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]404
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]407
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]409for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res98First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7namespace4
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]409namespace7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]417
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]06
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
Java
First non-repeating character is f80 First non-repeating character is f09 First non-repeating character is f10
First non-repeating character is f80 First non-repeating character is f12 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]428
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]431First non-repeating character is f22 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res20First non-repeating character is f16for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]436
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f35First non-repeating character is f36for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]443First non-repeating character is f16for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]445
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]447First non-repeating character is f53First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f35First non-repeating character is f36for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]456
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]459First non-repeating character is f53First non-repeating character is f64
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]463
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9namespace4 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]469for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]470First non-repeating character is f1
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f65
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]490First non-repeating character is f36for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res99
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]494
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]376
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7namespace4 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 First non-repeating character is f78
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]395
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]514
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f83#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]404
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]407
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]527First non-repeating character is f94for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res98for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]92
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7namespace4
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]527First non-repeating character is f94namespace7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]536
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
Python3
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]06
Java
First non-repeating character is f80 First non-repeating character is f09 First non-repeating character is f10
First non-repeating character is f80 First non-repeating character is f12 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]428
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]571for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res32First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]000for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]575for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res49First non-repeating character is f53for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]001
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]431First non-repeating character is f22 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res20First non-repeating character is f16for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]436
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4namespace4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res68
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f35First non-repeating character is f36for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]443First non-repeating character is f16for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]445
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f35First non-repeating character is f36for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]456
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]459First non-repeating character is f53First non-repeating character is f64
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]478
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f35First non-repeating character is f36for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]443First non-repeating character is f16for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]487
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]499for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res49First non-repeating character is f53First non-repeating character is f1
First non-repeating character is f80 First non-repeating character is f12 First non-repeating character is f27 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]512
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7namespace4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res68
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]524First non-repeating character is f53for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res99
using36 namespace94
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res15 First non-repeating character is f1for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]000for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]001
Is
Is
namespace4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res68
Các
C#
Các
First non-repeating character is f80 First non-repeating character is f09 First non-repeating character is f10
First non-repeating character is f80 First non-repeating character is f12 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]428
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]687
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]431First non-repeating character is f22 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res20First non-repeating character is f16for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]436
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f35First non-repeating character is f36for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]443First non-repeating character is f16for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]445
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]348
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f35First non-repeating character is f36for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]456
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]459First non-repeating character is f53First non-repeating character is f64
First non-repeating character is f65for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]358
First non-repeating character is f7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]478
First non-repeating character is f65for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]364
First non-repeating character is f7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 First non-repeating character is f35First non-repeating character is f36for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]443First non-repeating character is f16for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]487
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]499for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res49First non-repeating character is f53First non-repeating character is f1
First non-repeating character is f80 First non-repeating character is f12 First non-repeating character is f27 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]512
First non-repeating character is f65for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]733
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]524First non-repeating character is f53for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res99
using36 namespace94
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4namespace4
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res15 First non-repeating character is f1for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]000for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]001
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f80 First non-repeating character is f12 First non-repeating character is f27 First non-repeating character is f78
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f28 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]758
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f83#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]404
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]407
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]258
First non-repeating character is f65for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res98for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]92
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4namespace4
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]258
First non-repeating character is f65namespace7
First non-repeating character is f65for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]781
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
JavaScript
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]277
First non-repeating character is f15 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]280
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]790 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]791First non-repeating character is f22 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]793
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]795
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]790 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]346
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]348
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]790 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]807
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]812
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]816
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4namespace4
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]824
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]790 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]831
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]790 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]376
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f5for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]379
First non-repeating character is f7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]494
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]846for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]388
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7namespace4 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7 First non-repeating character is f78
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]790 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]758
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f83#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]790 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]404
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]865
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]323for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res98for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]92
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7namespace4
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]323namespace7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]536
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]331
Đầu ra
First non-repeating character is fPhân tích độ phức tạp:
- Độ phức tạp về thời gian: O (n). Vì chuỗi cần phải đi qua một lần: O(n).
As the string need to be traversed once - Không gian phụ trợ: O (1) .Space bị chiếm bởi việc sử dụng số lượng đếm để theo dõi tần số. O(1).
Space is occupied by the use of count-array to keep track of frequency.
Phương pháp số 4: Sử dụng các hàm Python tích hợp:
Approach:
- Tính tất cả các tần số của tất cả các ký tự bằng hàm bộ đếm ().
- Đi qua chuỗi và kiểm tra nếu bất kỳ phần tử nào có tần số 1.
- In ký tự và phá vỡ vòng lặp.
Dưới đây là việc thực hiện:
Python3
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]877 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]878using36 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]880
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res15 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]882
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]884for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]886
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res27for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res28 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res29
Các
First non-repeating character is f7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res96for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]901
First non-repeating character is f7First non-repeating character is f0
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res83for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 #include <iostream>9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]907
Độ phức tạp về thời gian: O (N). Vì chuỗi cần phải được đi qua tại địa điểm một lần. Không gian của nhà cung cấp: o (n). & Nbsp;O(n). As the string need to be traversed at-least once.
Auxiliary Space: O(n).
Sử dụng chức năng chuỗi tìm ():
Cách tiếp cận: Tìm kiếm mọi chữ cái sau vị trí hiện tại của nó. Nếu nó trả về -1, nó có nghĩa là chữ cái chỉ có một lần xuất hiện là chỉ mục hiện tại.Search every letter after its current position. should it return -1, it means the letter has just one occurrence that is the current index.
Implementation:
C++
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]908
using namespace for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]0
First non-repeating character is f27 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]913
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]914for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]918
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]914for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]527First non-repeating character is f5 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]923
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]527for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]926for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]927
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]926First non-repeating character is f0First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]527for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]914for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]914for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7First non-repeating character is f1
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]395
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]942#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]946
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
Python3
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res15 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]949
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]914for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res27for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res28 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]954
Is
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]926for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res96for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]901
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]926First non-repeating character is f0
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]914for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]973for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]975
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]976
C#
using First non-repeating character is f08
First non-repeating character is f80 First non-repeating character is f12 First non-repeating character is f09 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]982
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]984First non-repeating character is f80 First non-repeating character is f12 First non-repeating character is f27 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]988__
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]984for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 First non-repeating character is f3for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]2 for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]997
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]398First non-repeating character is f5 First non-repeating character is f000
First non-repeating character is f001First non-repeating character is f002
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f004
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f0First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]398for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]984for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]984for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]208 First non-repeating character is f12 First non-repeating character is f27 First non-repeating character is f78
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]984for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f28 First non-repeating character is f026#include <iostream>9First non-repeating character is f1
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]946
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]984for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
JavaScript
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]277
First non-repeating character is f15 First non-repeating character is f036
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]914for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2First non-repeating character is f039
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]914for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]527First non-repeating character is f5 First non-repeating character is f044
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]527for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]6
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]926First non-repeating character is f048
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]926First non-repeating character is f0
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]527for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]914for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]914for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res7
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res9
First non-repeating character is f058for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]975
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]976
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]331
Độ phức tạp về thời gian: O (n^2) không gian phụ trợ: O (1). & Nbsp;O(n^2)
Auxiliary Space: O(1).
& nbsp; Cách tiếp cận: Sử dụng phương thức Count (). Nếu số lượng ký tự cụ thể trong chuỗi là 1, thì ký tự không lặp lại. Sau khi tìm ký tự không lặp lại đầu tiên, hãy phá vỡ vòng lặp và hiển thị nó.Approach : Using count() method.If the count of particular character within the string is 1, then the character is non repeating.After finding the first non repeating character, break the loop and display it.
Python3
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res83for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 #include <iostream>9
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res82for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res49First non-repeating character is f53
First non-repeating character is f069for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13First non-repeating character is f071
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res2 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res27for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res28 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res29
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7First non-repeating character is f5 First non-repeating character is f078for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 First non-repeating character is f53for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res68
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f069for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res34for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]055
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4First non-repeating character is f0
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]7namespace4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res68
for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res82for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res34for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13First non-repeating character is f53
First non-repeating character is f5 for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res47for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res13 First non-repeating character is f53for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res68
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]984for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res96 First non-repeating character is f3for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res98for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res99
namespace4for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res68
for ( i=0 to str.length()) hash_map[str[i]]++; for(i=0 to str.length()) if(hash_map[str[i]]==1) return str[i]984for ( i=0 to str.length()) count_arr[str[i]].first++; count_arr[str[i]].second=i; int res=INT_MAX; for(i=0 to count_arr.size()) if(count_arr[str[i]].first==1) res=min(min, count_arr[str[i]].second) return res96 First non-repeating character is f3First non-repeating character is f05 First non-repeating character is f115
Đầu ra
First non-repeating character is fĐộ phức tạp về thời gian: O (n) không gian phụ trợ: O (1). & Nbsp;
Auxiliary Space: O(1).
Vấn đề liên quan: Nhân vật không lặp lại của K Khănth cho thấy nếu ai đó có một giải pháp tốt hơn, hiệu quả hơn về không gian và thời gian. Bài viết này được đóng góp bởi aarti_rathi. Vui lòng viết nhận xét nếu bạn tìm thấy bất cứ điều gì không chính xác hoặc bạn muốn chia sẻ thêm thông tin về chủ đề được thảo luận ở trên, hãy viết nhận xét nếu bạn tìm thấy bất cứ điều gì không chính xác hoặc bạn muốn chia sẻ thêm thông tin về chủ đề được thảo luận ở trên.
Please suggest if someone has a better solution which is more efficient in terms of space and time.
This article is contributed by Aarti_Rathi. Please write comments if you find anything incorrect, or you want to share more information about the topic
discussed above
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.