-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRail_Fencer.cpp
More file actions
128 lines (85 loc) · 1.8 KB
/
Copy pathRail_Fencer.cpp
File metadata and controls
128 lines (85 loc) · 1.8 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
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
#include <string>
using namespace std;
std::string encode_rail_fence_cipher(const std::string &str, int n) {
if(str.empty())
return str;
char test[n][str.size()];
for(int i=0;i<n;i++)
{
for(int j=0, len = str.size();j<len;j++)
test[i][j]='\n';
}
// after init
bool direc = false;
string res;
int row=0;
int col=0;
for(int j=0, len=str.size();j<len;j++)
{
if(row==0 || row==n-1)
direc=!direc;
test[row][col++] = str[j];
direc?row++:row--;
}
for(int i=0;i<n;i++)
{
for(int j=0, len=str.size();j<len;j++)
{
if(test[i][j]!='\n')
res.push_back(test[i][j]);
}
}
return res;
}
std::string decode_rail_fence_cipher(const std::string &str, int n) {
if(str.empty())
return str;
int len = str.size();
char test[n][len];
bool visit[n][len];
for(int i=0;i<n;i++)
{
for(int j=0;j<len;j++)
test[i][j]='\n';
}
for(int i=0;i<n;i++)
{
for(int j=0;j<len;j++)
visit[i][j]=false;
}
int row = 0, col=0;
bool direc=false;
for(int j=0;j<len;j++)
{
if(row==0)
direc = true;
if(row==n-1)
direc =false;
//test[row][col++]='*'; // mark pos
visit[row][col++]=true;
direc?row++:row--;
}
int idx=0;
string res;
for(int i=0;i<n;i++)
{
for(int j=0;j<len;j++)
{
if(visit[i][j]==true && idx<len)
test[i][j]=str[idx++];
}
}
row=0, col=0;
direc = false;
for(int i=0;i<len;i++)
{
if(row==0)
direc=true;
if(row==n-1)
direc=false;
res.push_back(test[row][col++]);
direc?row++:row--;
cout<<res<<endl;
}
return res;
}