Skip to content

Update #375

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 10 commits into
base: master
Choose a base branch
from
Open

Update #375

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
a4e87df
Update code-c-1.1：左旋转字符串
ld-pan Sep 10, 2014
220f9d4
Revert "Update code-c-1.1：左旋转字符串"
ld-pan Sep 10, 2014
da94514
Update code-c-1.1：左旋转字符串
ld-pan Sep 10, 2014
f81b5ae
Rename and Update 1.7：字符串的全排列.c
ld-pan Sep 11, 2014
5ac7bad
Update 01.05.md
ld-pan Sep 11, 2014
11caedc
Update code-c-1.1：左旋转字符串
ld-pan Sep 15, 2014
0ef0362
Revert "Update code-c-1.1：左旋转字符串"
ld-pan Sep 15, 2014
145a092
3.1：二分查找实现(Jon Bentley_90%程序员无法正确实现).cpp
ld-pan Sep 15, 2014
28db5d0
Rename 3.1：二分查找实现(Jon Bentley:90%程序员无法正确实现).go
ld-pan Sep 15, 2014
e208691
Rename ebook\code\python\2.5、2.7、2.8
ld-pan Sep 15, 2014
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
264 changes: 161 additions & 103 deletions ebook/code/c/1.1：左旋转字符串.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,9 +14,14 @@ void leftShift1(char * arr, int n)
size_t tmpLen = strlen(arr);
char tmpChar;
int i, j;

if (tmpLen == 0)
return ;

if (n >= 0)
{
for (i = 0; i < n; i++)
n %= tmpLen;
for (i = 0; i < n; i++)
{
tmpChar = *arr;
for (j = 0; j < tmpLen - 1; j++)
Expand All @@ -28,7 +33,8 @@ void leftShift1(char * arr, int n)
}
else
{
for (i = 0; i < -n; i++)
n = -((-n) % tmpLen)
for (i = 0; i < -n; i++)
{
tmpChar = *(arr + tmpLen - 1);
for (j = tmpLen - 1; j > 0; j--)
Expand All @@ -39,22 +45,37 @@ void leftShift1(char * arr, int n)
}
}
}

//指针移位法
void leftShift2(char * arr, int len, int n)
{
int i;
size_t tmpLen = len;
int p0 = 0;
int p1 = n;
int p0 = 0, p1;
char tmpChar;

if (n == 0)
return ;

if (n < 0)
n = len - (-1 * n) % len;
n %= len;
if (n == 0)
return ;

p1 = n;

/* O(m - n - k) k is the last section*/
while (p1 + n - 1 < tmpLen)
{
tmpChar = *(arr + p0);
*(arr + p0) = *(arr + p1);
*(arr + p1) = tmpChar;
p0++;
p1++;
for (i = 0; i < n; ++i)
{
tmpChar = *(arr + p0);
*(arr + p0) = *(arr + p1);
*(arr + p1) = tmpChar;
p0++;
p1++;
}
}
/*
* not good O(k * (n + k)) k = tmpLen - p1
Expand All @@ -79,34 +100,47 @@ void leftShift2(char * arr, int len, int n)
p1++;
}
}
//指针移位法,尾部处理用递归
void leftShift3(char * arr, int len, int n)
{
size_t tmpLen = len;
int p0 = 0;
int p1 = n;
char tmpChar;
/* O(m - n - k) k is the last section*/
while (p1 + n - 1 < tmpLen)
{
tmpChar = *(arr + p0);
*(arr + p0) = *(arr + p1);
*(arr + p1) = tmpChar;
p0++;
p1++;
}
if (p1 < tmpLen)
{
leftShift2(arr + p0, len - p0, n);
}
}

//指针移位法,尾部处理用递归 算法与leftshift2雷同 没有意义 没有递归
//void leftShift3(char * arr, int len, int n)
//{
// size_t tmpLen = len;
// int p0 = 0;
// int p1 = n;
// char tmpChar;
// /* O(m - n - k) k is the last section*/
// while (p1 + n - 1 < tmpLen)
// {
// tmpChar = *(arr + p0);
// *(arr + p0) = *(arr + p1);
// *(arr + p1) = tmpChar;
// p0++;
// p1++;
// }
// if (p1 < tmpLen)
// {
// leftShift2(arr + p0, len - p0, n);
// }
//}

//指针移位法,递归
void leftShift4(char * arr, int len, int n)
{
size_t tmpLen = len;
int p0 = 0;
int p1 = n;
int p0 = 0, p1;
char tmpChar;

if (len == 0)
return ;

if (n < 0)
n = len - (-1 * n) % len;
n %= len;
if (n == 0)
return ;

p1 = n;

/* O(m - n - k) k is the last section*/
while (p1 < tmpLen)
{
Expand Down Expand Up @@ -139,10 +173,21 @@ void myinvert(char * start, char * end)
//翻转法
void leftShift5(char * arr, int len, int n)
{
myinvert(arr, arr + n - 1);
if (len == 0)
return ;

if (n < 0)
n = len - (-1 * n) % len;
n %= len;

if (n == 0)
return ;

myinvert(arr, arr + n - 1);
myinvert(arr + n, arr + len - 1);
myinvert(arr, arr + len - 1);
}

int gcd(int m, int n)
{
int r;
Expand All @@ -153,13 +198,26 @@ int gcd(int m, int n)
}
return n;
}

//循环移位法
void leftShift6(char * arr, int len, int n)
{
int group = gcd(len, n);
char tmpChar;
int x = len / group;
int i, j;
int group, x, i, j;
char tmpChar;

if (len == 0)
return ;

if (n < 0)
n = len - (-1 * n) % len;
n %= len;

if (n == 0)
return ;

group = gcd(len, n);
x = len / group;

for (i = 0; i < group; i++)
{
tmpChar = *(arr + i);
Expand All @@ -172,70 +230,70 @@ void leftShift6(char * arr, int len, int n)
}
int main()
{
char str[50];
sprintf(str, "abcdefghijk");
printf("The origin str is :%s\tlen is :%zu\n", str, strlen(str));
printf("\n");
leftShift1(str, 2);
printf("The leftShift1 str is :%s\n", str);
leftShift1(str, -2);
printf("The leftShift1 str is :%s\n", str);
leftShift1(str, 3);
printf("The leftShift1 str is :%s\n", str);
leftShift1(str, strlen(str) - 3);
printf("The leftShift1 str is :%s\n", str);
printf("\n");

leftShift2(str, strlen(str), 3);
printf("The leftShift2 str is :%s\n", str);
leftShift2(str, strlen(str), strlen(str) - 3);
printf("The leftShift2 str is :%s\n", str);
leftShift2(str + 2, strlen(str) - 2, 2);
printf("The leftShift2 str is :%s\n", str);
leftShift2(str + 2, strlen(str) - 2, strlen(str) - 2 - 2);
printf("The leftShift2 str is :%s\n", str);
printf("\n");


leftShift3(str, strlen(str), 3);
printf("The leftShift3 str is :%s\n", str);
leftShift3(str, strlen(str), strlen(str) - 3);
printf("The leftShift3 str is :%s\n", str);
leftShift3(str + 2, strlen(str) - 2, 2);
printf("The leftShift3 str is :%s\n", str);
leftShift3(str + 2, strlen(str) - 2, strlen(str) - 2 - 2);
printf("The leftShift3 str is :%s\n", str);
printf("\n");

leftShift4(str, strlen(str), 3);
printf("The leftShift4 str is :%s\n", str);
leftShift4(str, strlen(str), strlen(str) - 3);
printf("The leftShift4 str is :%s\n", str);
leftShift4(str + 2, strlen(str) - 2, 2);
printf("The leftShift4 str is :%s\n", str);
leftShift4(str + 2, strlen(str) - 2, strlen(str) - 2 - 2);
printf("The leftShift4 str is :%s\n", str);
printf("\n");

leftShift5(str, strlen(str), 3);
printf("The leftShift5 str is :%s\n", str);
leftShift5(str, strlen(str), strlen(str) - 3);
printf("The leftShift5 str is :%s\n", str);
leftShift5(str + 2, strlen(str) - 2, 2);
printf("The leftShift5 str is :%s\n", str);
leftShift5(str + 2, strlen(str) - 2, strlen(str) - 2 - 2);
printf("The leftShift5 str is :%s\n", str);
printf("\n");

leftShift6(str, strlen(str), 3);
printf("The leftShift6 str is :%s\n", str);
leftShift6(str, strlen(str), strlen(str) - 3);
printf("The leftShift6 str is :%s\n", str);
leftShift6(str + 2, strlen(str) - 2, 2);
printf("The leftShift6 str is :%s\n", str);
leftShift6(str + 2, strlen(str) - 2, strlen(str) - 2 - 2);
printf("The leftShift6 str is :%s\n", str);
printf("\n");

return 0;
char str[50];
sprintf(str, "123456");
printf("The origin str is :%s\tlen is :%zu\n", str, strlen(str));
printf("\n");
leftShift1(str, 2);
printf("The leftShift1 str is :%s\n", str);
leftShift1(str, -2);
printf("The leftShift1 str is :%s\n", str);
leftShift1(str, 3);
printf("The leftShift1 str is :%s\n", str);
leftShift1(str, strlen(str) - 3);
printf("The leftShift1 str is :%s\n", str);
printf("\n");

leftShift2(str, strlen(str), 3);
printf("The leftShift2 str is :%s\n", str);
leftShift2(str, strlen(str), strlen(str) - 3);
printf("The leftShift2 str is :%s\n", str);
leftShift2(str + 2, strlen(str) - 2, 2);
printf("The leftShift2 str is :%s\n", str);
leftShift2(str + 2, strlen(str) - 2, strlen(str) - 2 - 2);
printf("The leftShift2 str is :%s\n", str);
printf("\n");


leftShift3(str, strlen(str), 3);
printf("The leftShift3 str is :%s\n", str);
leftShift3(str, strlen(str), strlen(str) - 3);
printf("The leftShift3 str is :%s\n", str);
leftShift3(str + 2, strlen(str) - 2, 2);
printf("The leftShift3 str is :%s\n", str);
leftShift3(str + 2, strlen(str) - 2, strlen(str) - 2 - 2);
printf("The leftShift3 str is :%s\n", str);
printf("\n");

leftShift4(str, strlen(str), 3);
printf("The leftShift4 str is :%s\n", str);
leftShift4(str, strlen(str), strlen(str) - 3);
printf("The leftShift4 str is :%s\n", str);
leftShift4(str + 2, strlen(str) - 2, 2);
printf("The leftShift4 str is :%s\n", str);
leftShift4(str + 2, strlen(str) - 2, strlen(str) - 2 - 2);
printf("The leftShift4 str is :%s\n", str);
printf("\n");

leftShift5(str, strlen(str), 3);
printf("The leftShift5 str is :%s\n", str);
leftShift5(str, strlen(str), strlen(str) - 3);
printf("The leftShift5 str is :%s\n", str);
leftShift5(str + 2, strlen(str) - 2, 2);
printf("The leftShift5 str is :%s\n", str);
leftShift5(str + 2, strlen(str) - 2, strlen(str) - 2 - 2);
printf("The leftShift5 str is :%s\n", str);
printf("\n");

leftShift6(str, strlen(str), 3);
printf("The leftShift6 str is :%s\n", str);
leftShift6(str, strlen(str), strlen(str) - 3);
printf("The leftShift6 str is :%s\n", str);
leftShift6(str + 2, strlen(str) - 2, 2);
printf("The leftShift6 str is :%s\n", str);
leftShift6(str + 2, strlen(str) - 2, strlen(str) - 2 - 2);
printf("The leftShift6 str is :%s\n", str);
printf("\n");

return 0;
}
Loading