forked from JiauZhang/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathleft_rotate_string.cpp
72 lines (62 loc) · 1.56 KB
/
left_rotate_string.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
/*
* Copyright(c) 2019 Jiau Zhang
* For more information see <https://github.com/JiauZhang/algorithms>
*
* This repo is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation
*
* It is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with THIS repo. If not, see <http://www.gnu.org/licenses/>.
*/
#include <iostream>
using namespace std;
void reverse(char *start, char *end)
{
if (!start || !end)
return;
while (start < end) {
char temp = *start;
*start = *end;
*end = temp;
start++;
end--;
}
}
void left_rotate(char *data, int offset)
{
if (!data || offset <=0)
return;
int length = 0;
char *start = data;
//cout << "step 1" << endl;
while (*start != '\0') {
length++;
start++;
}
if (offset >= length || length < offset)
return;
start = data;
char *end = data + offset - 1;
//cout << "step 2" << endl;
reverse(start, end);
//cout << "step 3" << endl;
start = end + 1;
end = data + length -1;
reverse(start, end);
//cout << "step 4" << endl;
start = data;
reverse(start, end);
}
int main(int argc, char **argv)
{
char sentence[] = "sentence";
left_rotate(sentence, 3);
cout << sentence << endl;
return 0;
}