约瑟夫环的链表表示代码,C代码库,德仔网

代码语言

代码分类

【C】约瑟夫环的链表表示

作者:曹德 / 发布于2011/8/31/ 461

<div>
#include <stdio.h>
#include <stdlib.h>
#define MAX_M 100
#define MAX_N 20
#define ITEMS_PER_LINE 5
void print_usage();
enum JOSEPHUS{
J_OK,
J_MEM,
J_PARAM
};
int josephus_l(int m,int n);
int main(int argc,char * argv[]){

int m,n;


if( argc < 3 ){
print_usage();
return 0;
}
m = atoi(argv[1]);
n = atoi(argv[2]);

if( m < 1 || m > MAX_M || n < 1 || n > MAX_N ){
print_usage();
}
if( J_MEM == josephus_l(m,n) ) printf("\nOut of memory!");
return 0;
}
void print_usage(){

printf("Usage:command <M> <N>\n");
printf("Note:1<M<=100,1<N<=20\n");
}

int josephus_l(int m,int n){

typedef struct Node{
int val;
struct Node * link;
}Node,* PNode;
int i,count;
PNode head = NULL,item,parent; 

if( m < 1 || m > MAX_M || n < 1 || n > MAX_N ){
return J_PARAM;
}

head = (PNode)malloc(sizeof(Node) * m);

if( !head ) return J_MEM;
printf("\nM=%d,N=%d\n\n",m,n);

item = head;
for( i = 0 ; i < m ; i++ ){
item->val = i + 1;

if( i == m -1 ){
item->link = head;
parent = item;
}else{
item->link = item + 1;
}
item++;
}
item = head;
for( i = 0; i < m ; i++ ){
//count
count = 0;
while(++count < n){
parent = item;
item = item->link;
}
//out
if( i != 0 && i % ITEMS_PER_LINE == 0) printf("\n");
printf("%3d:%5d out. ",i+1,item->val);
parent->link = item->link;
//move the current position
item = parent->link; 
}

printf("\n");
if(head)free(head);
return J_OK;
}

</div>

试试其它关键字

　约瑟夫环　

同语言下

可能有用的

曹德贡献的其它代码(1)

.约瑟夫环的链表表示