public ListNode FindKthToTail(ListNode head,int k) { int n = 0; ListNode key = head; for(ListNode first = head; first!=null; first = first.next){ if(k==n){ n--; key = key.next; } n++; } return key; }
这道题你会答吗?花几分钟告诉大家答案吧!
扫描二维码,关注牛客网
下载牛客APP,随时随地刷题