#include <stdio.h>
#include <stdlib.h>
?
int main()?
{?
?
?? int k=0,n=0,s=0,m=0;?????????? //k為1,2,3報數(shù)時的計數(shù)變量,m為退出人數(shù)
?? int num [100];
?? int *p=num;
?? int i;
?? printf("Enter the number of person and the key:");
?? scanf("%d%d",&n,&s);
?? for (i=0; i<n; ++i)
?? {?
????? *(p+i)=i+1;??????????????? //以1至n為序給每個人編號
?? }??????????????????????????
?? i = 0;
?? while (m<(n-1))????????????? //當(dāng)未退出人數(shù)大于1時執(zhí)行循環(huán)體?? (n-m) > 1
?? {
????? if (*(p+i)!=0)
????????? k++;
????? if (k==s)??????????????? //對退出的人編號置為0
????? {
????????? printf("%d\n",*(p+i));?????????????????????
????????? *(p+i)=0;
????????? k = 0;
????????? m++;
????? }
?????? i++;
????? if (n==i)???????????????
?????????? i = 0;?????????????? //報數(shù)到尾后,i恢復(fù)為0
??? }
???? while (*p==0)
??????? p++;
??? printf("The last one is :%d\n",*p);
??? system("PAUSE");??? ?
??? return 0;
}

======================================================
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <malloc.h>
?
/* 結(jié)構(gòu)體和函數(shù)聲明 */
typedef struct _node_t
{
??? int???????????? n_num;
??? struct _node_t *next;
} node_t;
?
node_t???????? *node_t_create(int n);
node_t???????? *node_t_get(node_t **pn, int m);
?
node_t * node_t_create(int n)
{
??? node_t *p_ret?? = NULL;
?
??? if (0 != n)
??? {
??????? int???? n_idx?? = 1;
??????? node_t *p_node? = NULL;
?
??????? /* 構(gòu)造 n 個 node_t */
??????? p_node = (node_t *) malloc(n * sizeof(node_t));
??????? if (NULL == p_node)
??????????? return NULL;
??????? else
??????????? memset(p_node, 0, n * sizeof(node_t));
?
??????? /* 內(nèi)存空間 申請 成功 */
??????? p_ret = p_node;
?
?
??????? for (; n_idx < n; n_idx++)
??????? {
??????????? p_node->n_num = n_idx;
??????????? p_node->next = p_node + 1;
??????????? p_node = p_node->next;
??????? }
??????? p_node->n_num = n;
??????? p_node->next = p_ret;
??? }
?
??? return p_ret;
}
?
?
int main()
{
??? int???? n, m;
??? node_t *p_list, *p_iter;
??? printf("Please enter the total and the key :");
??? scanf("%d%d",&n,&m);
??? printf("The total num is : %d \nThe?? key?? is?? : %d \n",n,m);
?
??? /* 構(gòu)造環(huán)形單向鏈表 */
??? p_list = node_t_create(n);
?
??? /* Josephus 循環(huán)取數(shù) */
??? p_iter = p_list;
??? m %= n;
??? while (p_iter != p_iter->next)
??? {
??????? int i?? = 1;
?
??????? /* 取到第 m-1 個節(jié)點 */
??????? for (; i < m - 1; i++)
??????? {
??????????? p_iter = p_iter->next;
??????? }
?
??????? /* 輸出第 m 個節(jié)點的值 */
??????? printf("%d ", p_iter->next->n_num);
?
??????? /* 從鏈表中刪除第 m 個節(jié)點 */
??????? p_iter->next = p_iter->next->next;
??????? p_iter = p_iter->next;
??? }
??? printf("%d ", p_iter->n_num);
?
??? /* 釋放 申請 的空間 */
??? free(p_list);
?
??? system("PAUSE");
}

轉(zhuǎn)載于:https://blog.51cto.com/qq164587043/49490

總結(jié)

以上是生活随笔為你收集整理的分别用 数组和链表处理约瑟夫环问题的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。