Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Solve is_unique with map #81

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Solve is_unique with map #81

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
ad0edd3
is_unique with map
quangnhat185 Oct 11, 2021
ae7c8c3
Remove loop
quangnhat185 Oct 11, 2021
85e70cc
Fix indent
quangnhat185 Oct 11, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 15 additions & 0 deletions Ch 1.Arrays And Strings/1.Is Unique/1. Is_unique.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,7 @@
#include <vector>
#include <iostream>
#include <bitset>
#include <map>
#include <algorithm> // for sort()

using namespace std;
Expand Down Expand Up @@ -49,6 +50,20 @@ bool isUniqueChars_noDS( string str) {
return noRepeat;
}

bool is_unique(string str){
map<char, int> character_counts;

for (char c: str){
for (auto it=character_counts.begin(); it!=character_counts.end(); it++){
if (c==it->first){
return false;
}
}
character_counts[c]=1;
}
return true;
}

int main(){
vector<string> words = {"abcde", "hello", "apple", "kite", "padle"};
for (auto word : words)
Expand Down