{"id":830,"date":"2012-03-15T02:17:05","date_gmt":"2012-03-15T02:17:05","guid":{"rendered":"http:\/\/41j.com\/blog\/?p=830"},"modified":"2012-03-15T02:17:44","modified_gmt":"2012-03-15T02:17:44","slug":"a-singly-linked-list-with-reverse","status":"publish","type":"post","link":"https:\/\/41j.com\/blog\/2012\/03\/a-singly-linked-list-with-reverse\/","title":{"rendered":"A singly linked list with reverse&#8230;"},"content":{"rendered":"<p>In (not particularly beautiful) C++, both recursive and non-recursive reverse methods:<\/p>\n<pre class=\"brush: cpp; title: ; notranslate\" title=\"\">\r\n#include &lt;iostream&gt;\r\nusing namespace std;\r\n\r\nclass ListItem {\r\n\r\npublic:\r\n\r\n  ListItem() : next(NULL)\r\n  {}\r\n\r\n  char data&#x5B;100];\r\n  ListItem *next;\r\n\r\n  void reverse(ListItem *p) {\r\n    if(next == NULL) {\r\n      next = p;\r\n    } else {\r\n      next-&gt;reverse(this);\r\n      next = p;\r\n    }\r\n  }\r\n};\r\n\r\nclass LinkedList {\r\n\r\npublic:\r\n\r\n  LinkedList() {}\r\n\r\n  ListItem *start;\r\n  ListItem *end;\r\n\r\n  ListItem *push_back(char *data) {\r\n  \r\n\r\n    ListItem *i = new ListItem();\r\n\r\n    if(end != NULL) { end-&gt;next = i; }\r\n               else { start = i; }\r\n\r\n    for(size_t n=0;n&lt;100;n++) {i-&gt;data&#x5B;n] = data&#x5B;n];}\r\n\r\n    end = i;\r\n    return i;\r\n  }\r\n\r\n  void reverse() {\r\n    start-&gt;reverse(NULL);\r\n    ListItem *temp = end;\r\n    end = start;\r\n    start = temp;\r\n  }\r\n\r\n  void reverse_nonrec() {\r\n  \r\n    ListItem *last=NULL;\r\n    for(ListItem *p=start;p!=NULL;) {\r\n      ListItem *next = p-&gt;next;\r\n\r\n      p-&gt;next = last;\r\n      last = p;\r\n      p = next;\r\n    }\r\n\r\n    ListItem *temp = end;\r\n    end = start;\r\n    start = temp;\r\n  }\r\n\r\n  void dump() {\r\n    for(ListItem *p=start;p!=NULL;p=p-&gt;next) {\r\n      cout &lt;&lt; &quot;data: &quot; &lt;&lt; p-&gt;data &lt;&lt; endl;\r\n    }\r\n  }\r\n\r\n  ~LinkedList() {\r\n    ListItem *op = NULL;\r\n    for(ListItem *p=start;p!=NULL;p=p-&gt;next) {\r\n      if(op != NULL) delete op;\r\n      op = p;\r\n    }\r\n    if(op != NULL) delete op;\r\n  }\r\n\r\n};\r\n\r\nint main() {\r\n\r\n  LinkedList mylist;\r\n\r\n  char tempdata&#x5B;100];\r\n  for(size_t n=0;n&lt;100;n++) { tempdata&#x5B;n] = 'A'; }\r\n  tempdata&#x5B;99] = 0;\r\n  for(size_t n=0;n&lt;20;n++) {\r\n    mylist.push_back(tempdata);\r\n    for(size_t n=0;n&lt;99;n++) { tempdata&#x5B;n]++; }\r\n  }\r\n\r\n  mylist.dump();\r\n  mylist.reverse();\r\n\r\n  cout &lt;&lt; &quot;Reversed List&quot; &lt;&lt; endl;\r\n  mylist.dump();\r\n\r\n  cout &lt;&lt; &quot;Reverse again&quot; &lt;&lt; endl;\r\n  mylist.reverse_nonrec();\r\n  mylist.dump();\r\n\r\n  \r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>In (not particularly beautiful) C++, both recursive and non-recursive reverse methods: #include &lt;iostream&gt; using namespace std; class ListItem { public: ListItem() : next(NULL) {} char data&#x5B;100]; ListItem *next; void reverse(ListItem *p) { if(next == NULL) { next = p; } else { next-&gt;reverse(this); next = p; } } }; class LinkedList { public: LinkedList() {} [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[1],"tags":[],"class_list":["post-830","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p1RRoU-do","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/posts\/830","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/comments?post=830"}],"version-history":[{"count":2,"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/posts\/830\/revisions"}],"predecessor-version":[{"id":832,"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/posts\/830\/revisions\/832"}],"wp:attachment":[{"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/media?parent=830"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/categories?post=830"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/41j.com\/blog\/wp-json\/wp\/v2\/tags?post=830"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}