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
75 lines (65 loc) · 1.75 KB
/
Password.cpp
File metadata and controls
75 lines (65 loc) · 1.75 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
66
67
68
69
70
71
72
73
74
75
#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
*/
bool Password::has_mixed_case(string str)
{
bool found = false;
for(char c : str){
if( !found && c >= 'A' && c <= 'Z' ){
found = true;
}
else if( found && c >= 'a' && c <= 'z'){
return true;
}
}
return false;
}
/* Receives a string and returns a count of
how many case-sensitive unique characters there are.
If there are duplicate instances of the same character
it should only count as a single character.
Even if characters look similar,
as long as they have distinct ASCII values,
they should qualify as unique characters. */
unsigned int Password::unique_characters(string str)
{
if (str.size() == 0) {
return 0;
}
char used[256];
int usedCount = 0;
for (int i = 0; i < str.size(); i++) {
char c = str[i];
bool found = false;
for (int j = 0; j < usedCount; j++) {
if (used[j] == c) {
found = true;
break;
}
}
if (!found) {
used[usedCount] = c;
usedCount++;
}
}
return usedCount;
}