{"width":"100%","description":"http://www.geocities.jp/ky_webid/algorithm/012.html\u9006\u65b9\u5411\u306b\u3082\u53c2\u7167\u3067\u304d\u308b\u53cc\u65b9\u5411\u30ea\u30b9\u30c8\u3067\u3059\u306d\u3002\u5faa\u74b0\u30ea\u30b9\u30c8\u306e\u62e1\u5f35\u3067\u3084\u3063\u3066\u307f\u307e\u3059\u3002 #include <stdio.h> #include <stdlib.h> struct LIST { int data; int last; struct LIST *next; struct LIST *prev; }; typedef struct LIST LIST; LIST *create_list(int data) { LIST *p; p = (LIST *)malloc(sizeof(LIST));\u2026","author_url":"https://blog.hatena.ne.jp/pknight/","type":"rich","blog_url":"https://pknight.hatenablog.com/","blog_title":"(void*)P\u306a\u3044\u3068","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fpknight.hatenablog.com%2Fentry%2F20090706%2F1246847244\" title=\"\u53cc\u65b9\u5411\u30ea\u30b9\u30c8 - (void*)P\u306a\u3044\u3068\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","published":"2009-07-06 11:27:24","author_name":"pknight","title":"\u53cc\u65b9\u5411\u30ea\u30b9\u30c8","provider_name":"Hatena Blog","categories":["C","algorithm"],"version":"1.0","url":"https://pknight.hatenablog.com/entry/20090706/1246847244","image_url":null,"height":"190"}