题目
code
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode removeElements(ListNode head, int val) {
return dg(head, val);
}
private ListNode dg(ListNode head, int val) {
if (head == null) {
return head;
}
if(head.val == val) {
return dg(head.next, val);
}
head.next = dg(head.next, val);
return head;
}
}
code:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int kthToLast(ListNode head, int k) {
return dg(head, k);
}
int m = 0;
private int dg(ListNode cur, int k) {
if (cur != null) {
int v = dg(cur.next, k);
if (m == k-1) {
m++;
return cur.val;
} else {
m++;
return v;
}
} else {
return 0;
}
}
}