#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string.h>
//
//
// //用库函数判断是否为反转字符
int is_left_move(char *s1, char *str2)
{
int len = strlen(s1);
int len1 = strlen(str2);
if (len != len1)
{
return 0;
}
strncat(s1, s1,6);//可以
/*strcat(s1, s1);*///不可以追加自己的字符
char*ret = strstr(s1, str2);
if (ret == NULL)
{
return 0;
}
else
{
return 1;
}
}
int main()
{
char arr1[30] = "abcdef";
char arr2[] = "cdefab";
int ret = is_left_move(arr1, arr2);
if (ret == 1)
{
printf("yes\n");
}
else{
printf("no\n");
}
return 0;
}
// 杨氏矩阵 查找数字
int findnum(int arr[][3], int k, int *px, int *py)
{
int x = 0;
int y = *py-1;
while (x <=*px-1 && y >= 0)
{
if (arr[x][y] > k)
{
y--;
}
else if (arr[x][y]<k)
{
x++;
}
else
{
*px = x;
*py = y;
return 1;
}
}
return 0;
}
int main()
{
int arr[3][3] = { { 1, 2, 3 }, { 4, 5, 6 }, { 7, 8, 9 } };
int k = 7;
int x = 3;
int y = 3;
int ret = findnum(arr, k, &x, &y);
if (ret == 1)
{
printf("找到了\n ");
printf("下标为%d %d\n", x, y);
}
else
{
printf("没有\n");
}
return 0;
}
int findnum(int arr[][3], int k, int row, int col)
{
int x = 0;
int y = col - 1;
while (x<=col-1&&y>=0)
{
if (arr[x][y] > k)
{
y--;
}
else if (arr[x][y]<k)
{
x++;
}
else
{
return 1;
}
}
return 0;
}
int main()
{
int arr[3][3] = { { 1, 2, 3 }, { 4, 5, 6 }, { 7, 8, 9 } };
int k = 17;
int ret = findnum(arr, k, 3, 3);
if (ret == 1)
{
printf("找到了\n ");
}
else
{
printf("没有\n");
}
return 0;
}