一直没理解。看这个倒是看懂了。但是博主代码好像有点问题吖。测试并不正确。思想还是没错的。
相关文章
- KMP 求next数组
- 【转载】KMP入门级别算法详解--终于解决了（next数组详解）
- 有序数组两两交换，求最小的交换次数。
- 三维数组按行优先存储求某位置的地址
- #include <> typedef struct Node { int index; struct Node *next; }JosephuNode; int Josephu(int n, int m) { int i, j; JosephuNode *head, *tail; head = tail = (JosephuNode *)malloc(sizeof(JosephuNode)); for (i = 1; i < n; ++i) { tail->index = i; tail->next = (JosephuNode *)malloc(sizeof(JosephuNode)); tail = tail->next; } tail->index = i; tail->next = head; for (i = 1; tail != head; ++i) { for (j = 1; j < m; ++j) { tail = head; head = head->next; } tail->next = head->next; printf("第%4d个出局的人是：%4d号\n", i, head->index); free(head); head = tail->next; } i = head->index; free(head); return i; } int main { int n, m; scanf("%d%d", &n, &m); printf("最后胜利的是%d号！\n", Josephu(n, m)); system("pause"); return 0; }">设编号为1，2，… n的n个人围坐一圈，约定编号为k（1数组实现： #include <> #include <> int Josephu(int n, int m) { int flag, i, j = 0; int *arr = (int *)malloc(n * sizeof(int)); for (i = 0; i < n; ++i) arr[i] = 1; for (i = 1; i < n; ++i) { flag = 0; while (flag < m) { if (j == n) j = 0; if (arr[j]) ++flag; ++j; } arr[j - 1] = 0; printf("第%4d个出局的人是：%4d号\n", i, j); } free(arr); return j; } int main { int n, m; scanf("%d%d", &n, &m); printf("最后胜利的是%d号！\n", Josephu(n, m)); system("pause"); return 0; } 链表实现： #include <> #include <> typedef struct Node { int index; struct Node *next; }JosephuNode; int Josephu(int n, int m) { int i, j; JosephuNode *head, *tail; head = tail = (JosephuNode *)malloc(sizeof(JosephuNode)); for (i = 1; i < n; ++i) { tail->index = i; tail->next = (JosephuNode *)malloc(sizeof(JosephuNode)); tail = tail->next; } tail->index = i; tail->next = head; for (i = 1; tail != head; ++i) { for (j = 1; j < m; ++j) { tail = head; head = head->next; } tail->next = head->next; printf("第%4d个出局的人是：%4d号\n", i, head->index); free(head); head = tail->next; } i = head->index; free(head); return i; } int main { int n, m; scanf("%d%d", &n, &m); printf("最后胜利的是%d号！\n", Josephu(n, m)); system("pause"); return 0; }
- 求二维数组每行的最大值
- POJ3080 POJ3450Corporate Identity（广义后缀自动机||后缀数组||KMP）
- 输入一个二维数组，求二维数组中各行元素的和。
- 求二维数组每行元素之和
- 求二维数组每一列（行）上的最大值（Java）