-
BingoPython:
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: # @param {ListNode} node # @return {void} Do not return anything, modify node in-place instead. def deleteNode(self, node): node.val = node.next.val node.next = node.next.next
-
BingoC++:
void deleteNode(ListNode* node) { auto next = node->next; *node = *next; delete next; }
-
BingoJava:
public void deleteNode(ListNode node) { node.val = node.next.val; node.next = node.next.next; }
-
BingoC:
void deleteNode(struct ListNode* node) { struct ListNode* next = node->next; *node = *next; free(next); }
-
BingoJavaScript:
var deleteNode = function(node) { node.val = node.next.val; node.next = node.next.next; };
-
BingoRuby:
def delete_node(node) node.val = node.next.val node.next = node.next.next nil end
-