-
Notifications
You must be signed in to change notification settings - Fork 2
/
q0237.swift
70 lines (68 loc) · 1.54 KB
/
q0237.swift
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
//
// q0237.swift
// LeetcodeSwift
//
// Created by NowOrNever on 03/06/2020.
// Copyright © 2020 DL. All rights reserved.
//
import Foundation
//237. Delete Node in a Linked List
//Easy
//
//1451
//
//6725
//
//Add to List
//
//Share
//Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
//
//Given linked list -- head = [4,5,1,9], which looks like following:
//
//
//
//
//
//Example 1:
//
//Input: head = [4,5,1,9], node = 5
//Output: [4,1,9]
//Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
//Example 2:
//
//Input: head = [4,5,1,9], node = 1
//Output: [4,5,9]
//Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
//
//
//Note:
//
//The linked list will have at least two elements.
//All of the nodes' values will be unique.
//The given node will not be the tail and it will always be a valid node of the linked list.
//Do not return anything from your function.
//Accepted
//430,691
//Submissions
//696,278
/**
* Definition for singly-linked list.
* public class ListNode {
* public var val: Int
* public var next: ListNode?
* public init(_ val: Int) {
* self.val = val
* self.next = nil
* }
* }
*/
class q0237Solution {
func deleteNode(_ node: ListNode?) {
guard let node = node else {
return
}
node.val = node.next!.val
node.next = node.next!.next
}
}