|
| 1 | + |
| 2 | +>仰望星空的人,不应该被嘲笑 |
| 3 | + |
| 4 | +## 题目描述 |
| 5 | + |
| 6 | +给定单向链表的头指针和一个要删除的节点的值,定义一个函数删除该节点。 |
| 7 | + |
| 8 | +返回删除后的链表的头节点。 |
| 9 | + |
| 10 | +注意:此题对比原题有改动 |
| 11 | + |
| 12 | +示例 1: |
| 13 | + |
| 14 | +```javascript |
| 15 | +输入: head = [4,5,1,9], val = 5 |
| 16 | +输出: [4,1,9] |
| 17 | +解释: 给定你链表中值为 5 的第二个节点,那么在调用了你的函数之后,该链表应变为 4 -> 1 -> 9. |
| 18 | +``` |
| 19 | + |
| 20 | +示例 2: |
| 21 | + |
| 22 | +```javascript |
| 23 | +输入: head = [4,5,1,9], val = 1 |
| 24 | +输出: [4,5,9] |
| 25 | +解释: 给定你链表中值为 1 的第三个节点,那么在调用了你的函数之后,该链表应变为 4 -> 5 -> 9. |
| 26 | + |
| 27 | +``` |
| 28 | + |
| 29 | +说明: |
| 30 | + |
| 31 | +题目保证链表中节点的值互不相同 |
| 32 | +若使用 C 或 C++ 语言,你不需要 free 或 delete 被删除的节点 |
| 33 | + |
| 34 | +来源:力扣(LeetCode) |
| 35 | +链接:https://leetcode-cn.com/problems/shan-chu-lian-biao-de-jie-dian-lcof |
| 36 | +著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。 |
| 37 | + |
| 38 | +## 解题思路 |
| 39 | +创建一个新链表,遇到相同值的情况,将当前节点的next指向下一个节点的next,否则继续遍历。 |
| 40 | + |
| 41 | +```javascript |
| 42 | +/** |
| 43 | + * Definition for singly-linked list. |
| 44 | + * function ListNode(val) { |
| 45 | + * this.val = val; |
| 46 | + * this.next = null; |
| 47 | + * } |
| 48 | + */ |
| 49 | +/** |
| 50 | + * @param {ListNode} head |
| 51 | + * @param {number} val |
| 52 | + * @return {ListNode} |
| 53 | + */ |
| 54 | +var deleteNode = function(head, val) { |
| 55 | + let dummyHead = new ListNode(); |
| 56 | + dummyHead.next = head; |
| 57 | + let p = dummyHead; |
| 58 | + while(p.next){ |
| 59 | + if(p.next.val === val){ |
| 60 | + p.next = p.next.next; |
| 61 | + }else{ |
| 62 | + p = p.next; |
| 63 | + } |
| 64 | + } |
| 65 | + return dummyHead.next; |
| 66 | +}; |
| 67 | +``` |
| 68 | + |
| 69 | + |
| 70 | + |
| 71 | + |
| 72 | +## 最后 |
| 73 | +文章产出不易,还望各位小伙伴们支持一波! |
| 74 | + |
| 75 | +往期精选: |
| 76 | + |
| 77 | +<a href="https://github.com/Chocolate1999/Front-end-learning-to-organize-notes">小狮子前端の笔记仓库</a> |
| 78 | + |
| 79 | +<a href="https://github.com/Chocolate1999/leetcode-javascript">leetcode-javascript:LeetCode 力扣的 JavaScript 解题仓库,前端刷题路线(思维导图)</a> |
| 80 | + |
| 81 | +小伙伴们可以在Issues中提交自己的解题代码,🤝 欢迎Contributing,可打卡刷题,Give a ⭐️ if this project helped you! |
| 82 | + |
| 83 | + |
| 84 | +<a href="https://yangchaoyi.vip/">访问超逸の博客</a>,方便小伙伴阅读玩耍~ |
| 85 | + |
| 86 | + |
| 87 | + |
| 88 | +```javascript |
| 89 | +学如逆水行舟,不进则退 |
| 90 | +``` |
| 91 | + |
| 92 | + |
0 commit comments