-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTest.cpp
129 lines (102 loc) · 1.89 KB
/
Test.cpp
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void test(string c);
void separate();
int findFreq(string s);
void printArray(int arr[], int len);
int largest(int arr[], int len);
void vectorTest();
void printvector(vector<string> s, int l);
int main() {
//vectorTest();
test("e");
}
void vectorTest() {
vector<string> wrds;
int size = 0;
int k = 97;
for(int i = 0; i < 10; i++) {
string w = "";
w += k;
wrds.push_back(w);
size++;
k++;
}
printvector(wrds, size);
string c = "j";
vector<string>::iterator it = wrds.begin();
for(int i = 0; i < size; i++, it++) {
string temp = wrds[i];
if(temp.find(c) != string::npos) {
wrds.erase(it);
size--;
}
}
printvector(wrds, size);
}
void printvector(vector<string> s, int l) {
cout << "[";
for(int i = 0; i < l; i++) {
if(i == (l - 1)) {
cout << s[i] << "]";
}
else {
cout << s[i] << ", ";
}
}
cout << endl;
}
void test(string c) {
string temp = "test";
if(temp.find("e") != string::npos) {
cout << "First test should return: [1,0,0,0], 0" << endl;
int temp = findFreq(c);
cout << temp;
cout << endl;
}
else {
cout << "Not in string" << endl;
}
}
void printArray(int arr[], int len) {
cout << "[";
for(int i = 0; i < len; i++) {
if(i == (len -1 )) {
cout << arr[i];
}
else {
cout << arr[i] << ",";
}
}
cout << "], ";
}
void separate() {
cout << "~~~~~~~~~~~~~~~~~~" << endl;
}
int findFreq(string c) {
string s = "test";
int wordLength = 4;
int pos[wordLength];
for(int i = 0; i < wordLength; i++) {
pos[i] = 0;
}
for(int k = 0; k <= wordLength; k++) {
if((s.find(c) == k) && (k <= wordLength)) {
pos[k]++;
}
}
int freq = largest(pos, wordLength);
printArray(pos, wordLength);
return freq;
}
int largest(int nums[], int len) {
int most = 0;
for(int i = 0; i < len; i++) {
if(nums[i] > most) {
most = i;
}
}
return most;
}