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
60 lines (54 loc) · 1.6 KB
/
Password.cpp
File metadata and controls
60 lines (54 loc) · 1.6 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
#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)
{
bool has_lower = false;
bool has_upper = false;
for (char ch : str)
{
if (std::islower(ch))
{
has_lower = true;
}
else if (std::isupper(ch))
{
has_upper = true;
}
}
return has_lower && has_upper;
}
/* 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 input)
{
bool seen[256] = {false};
unsigned int count = 0;
for (size_t i = 0; i < input.length(); i++) {
unsigned char index = static_cast<unsigned char>(input[i]);
if (!seen[index]) {
seen[index] = true;
count++;
}
}
return count;
}