Function recursiveBackCounterDelete

tasks/19.go:22–38

0 – found -1 – delete next

(head *ListNode, n int)

// 0 – found
// -1 – delete next
func recursiveBackCounterDelete(head *ListNode, n int) int {
	if head == nil {
		return 1
	}
	ret := recursiveBackCounterDelete(head.Next, n)
	if ret == 0 {
		return 0
	}
	if ret == -1 {
		head.Next = head.Next.Next
		return 0
	}
	if ret == n {
		return -1
	}
	return ret++
}