首页 > 代码库 > 找到链表的倒数第K位
找到链表的倒数第K位
#include<iostream> using namespace std; class node{ public: node():value(0),next(NULL){} ~node(){} int value; node* next; };///be careful this ; node* createlist(int a[],int n) { node* startnode = new node[n]; node* ret = startnode; for(int i = 0;i<n;i++) { startnode[i].value = a[i]; if(i<n-1) startnode[i].next = startnode + i + 1; } while(startnode) { cout<<" "<<startnode->value; startnode = startnode->next; } cout<<endl; return ret; } int helper(node* nd,int k) { node* cursor1 = nd; node* cursor2 = nd; while(--k) cursor2 = cursor2->next; while(cursor2->next) { cursor1 = cursor1->next; cursor2 = cursor2->next; } return cursor1->value; } int main() { int a[] = {1,2,3,4,5,6,7,8,9}; node * t = createlist(a,9); cout<<helper(t,3); }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。