(head *ListNode, n int)
| 10 | } |
| 11 | |
| 12 | func removeNthFromEnd(head *ListNode, n int) *ListNode { |
| 13 | ret := recursiveBackCounterDelete(head, n) |
| 14 | if ret == -1 { |
| 15 | return head.Next |
| 16 | } |
| 17 | return head |
| 18 | } |
| 19 | |
| 20 | // 0 – found |
| 21 | // -1 – delete next |
nothing calls this directly
no test coverage detected