剑指Offer18:删除链表的节点(Golang/Python/C#)

原题链接：剑指Offer18:删除链表的节点

• 时间复杂度O(N):N为链表长度，删除操作平均需循环N/2次，最差N次。
• 空间复杂度O(1):cur , pre占用常数大小额外空间。

Golang

package main

type ListNode struct {
	Val  int
	Next *ListNode
}

func deleteNode(head *ListNode, val int) *ListNode {
	if head.Val == val {
		return head.Next
	}
	var pre = head
	var cur = head.Next
	for ; cur != nil && cur.Val != val; {
		pre = pre.Next
		cur = cur.Next
	}
	if cur != nil {
		pre.Next = cur.Next
	}
	return head
}

Python

class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None


class Solution:
    def deleteNode(self, head: ListNode, val: int) -> ListNode:
        if head.val == val: return head.next
        pre, cur = head, head.next
        while cur and cur.val != val:
            pre, cur = pre.next, cur.next
        if cur: pre.next = cur.next
        return head

C#

public class ListNode
{
    public int val;
    public ListNode next;
    public ListNode(int x) { val = x; }
}
public class Solution
{
    public ListNode DeleteNode(ListNode head, int val)
    {
        if (head.val == val) {
            return head.next;
        }
        ListNode pre = head;
        ListNode cur = head.next;
        while (cur != null && cur.val != val) {
            pre = pre.next;
            cur = cur.next;
        }
        if (cur != null) {
            pre.next = cur.next;
        }
        return head;
    }
}