forked from ChicoState/UnitTestPractice
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPassword.cpp
More file actions
68 lines (57 loc) · 1.47 KB
/
Password.cpp
File metadata and controls
68 lines (57 loc) · 1.47 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include "Password.h"
#include <string>
using std::string;
/*
The function receives a string counts how many times the same character
occurs at the beginning of the string, before any other characters (or the
end of the string). The function is case-sensitive so 'Z' is different than
'z' and any ASCII characters are allowed.
*/
int Password::count_leading_characters(string phrase){
int repetition = 1;
int index = 0;
while( index < phrase.length()-1 && phrase[index] == phrase[index+1] ){
repetition++;
index++;
}
return repetition;
}
/*
receives a string and returns whether it has both at least one upper-case
letter and at least one lower-case letter
*/
#include <cctype>
bool Password::has_mixed_case(string str)
{
int count_lower = 0;
for (int i = 0; i < str.length(); i++)
{
if (str[i] >= 'a' && str[i] <= 'z')
{
count_lower++;
}
}
return count_lower > 0 && count_lower < str.length();
}
// x13 - get unique characters
#include <vector>
int Password::get_unique_chars(string word) {
std::vector<char> unique_chars;
// check word chars
for(int i = 0; i < word.length(); i++){
char c = word[i];
bool unique = true;
// check unique chars
for (int j = 0; j < unique_chars.size(); j++){
if(c == unique_chars[j]){
unique = false;
}
}
// update unique chars
if(unique){
unique_chars.push_back(c);
}
}
// return 'n' characters
return unique_chars.size();
}