-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathPrintPattern.cpp
More file actions
70 lines (59 loc) · 1.71 KB
/
Copy pathPrintPattern.cpp
File metadata and controls
70 lines (59 loc) · 1.71 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
//Copyright [2018] [Haibo Yan]
//
//Licensed under the Apache License, Version 2.0 (the "License");
//you may not use this file except in compliance with the License.
//You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
//Unless required by applicable law or agreed to in writing, software
//distributed under the License is distributed on an "AS IS" BASIS,
//WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
//See the License for the specific language governing permissions and
//limitations under the License.
//
// Created by haibo on 3/19/18.
//
#include "PrintPattern.h"
string PrintPattern::count_and_say(int n) {
if (n < 1) {
return "";
}
string saying = "1";
for (int i = 2; i < n; i++) {
string next = "";
for (int j = 0; j < saying.size(); j++) {
int v = saying[j++] - '0';
int c = 1;
while (j < saying.size() && saying[j] == saying[j - 1]) {
c++;
}
next += c;
next += v;
}
saying = next;
}
return saying;
}
vector<vector<int>> PrintPattern::pattern(int n) {
vector<vector<int>> p;
if (n >= 1) {
vector<int> v{1};
p.push_back(v);
for (int i = 2; i < n; i++) {
vector<int> n;
vector<int> l = p[p.size() - 1];
for (int j = 0; j < l.size(); j++) {
int v = l[j];
int c = 1;
while (j < l.size() && l[j] == l[j - 1]) {
c++;
}
n.push_back(c);
n.push_back(v);
}
p.push_back(n);
}
}
return p;
}