链表训练
文章平均质量分 83
shengdai20
这个作者很懒,什么都没留下…
展开
-
双循环链表
//nyoj511移动小球 #include #include typedef struct node { int data; struct node *pre, *rear; }Lnode; Lnode *creat_list(Lnode *head, int num) { Lnode *current, *phead; phead =原创 2014-10-26 17:50:06 · 361 阅读 · 0 评论 -
猴子选大王问题&&约瑟夫环问题
#include #define MAX 1000 int main() { int n, a, b, str[MAX], i, count, sum; scanf("%d", &n); while(n--) { scanf("%d%d", &a, &b); for(i = 0; i s原创 2014-09-02 15:33:47 · 410 阅读 · 0 评论 -
hdoj1251统计问题
统计难题 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 19905 Accepted Submission(s): 8723 Problem Description Ignatius最近遇到一个难题,老师原创 2015-02-27 01:32:52 · 300 阅读 · 0 评论 -
nyoj163phone list 字典树
Phone List 时间限制:1000 ms | 内存限制:65535 KB 难度:4 描述 Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let's say the phone原创 2014-10-31 14:45:31 · 376 阅读 · 0 评论