237. Delete Node in a Linked List

最新推荐文章于 2022-10-13 09:44:00 发布
原创 最新推荐文章于 2022-10-13 09:44:00 发布 · 113 阅读 · 0 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文介绍了一种在链表中仅通过访问特定节点来删除该节点的方法。具体操作是将下一节点的值复制到当前节点，并调整指针指向下一节点的下一个节点，从而实现了在没有头结点的情况下移除一个节点。

删除一节点，且在链表中只有针对该节点的访问权：

方法为删除该节点的下一个节点，并将下一节点的val赋给当前节点

  void deleteNode(ListNode* node) {
        node->val=node->next->val;
        node->next=node->next->next;
    }

 

python-leetcode题解之237-Delete-Node-in-a-Linked-List.py
09-12
针对leetcode题库中的“Delete Node in a Linked List”题目，我们主要探讨如何在不访问链表头节点的情况下，删除给定节点。按照标准的链表删除操作，通常我们会要求知道前一个节点以便将其next指针指向空，表示删除...
leetcode不会-delete-node-in-a-linked-list:删除链表中的节点
06-30
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 ...
237DeleteNodeinaLinkedList
u010217321的专栏
05-10 266
Delete Node in a LinkedList
katrina95的博客
05-23 149
Given one node in a linked list, remove that node. (Only the reference to the specific node is given). Examples: Input: 1->2->3->4, 3 Output: 1->2->4 由于只给了要删除的node，因此找不到之前的node，所以我们把后面的...
Delete Node in a Linked List（删除链表中的节点）
ajiangfan的博客
09-24 1464
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.(实现删除一个除尾节点外的链表节点的函数，假定只能访问被删节点)Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are give
leetcode 237. Delete Node in a Linked List（链表中删除节点）
蓝羽飞鸟的博客
10-13 384
leetcode 237
Leetcode 237. Delete Node in a Linked List-删除链表的指定节点，不给链表的头节点
Top5软件工程硕士，先后在京东、字节从事多年Java后端开发、实时和离线大数据开发
04-05 986
Write a function todelete a nodein a singly-linked list. You willnotbe given access to theheadof the list, instead you will be given access tothe node to be deleteddirectly. It isguaranteedthat the node to be deleted isnot a tail nodein the li...
[LeetCode]--237. Delete Node in a Linked List
杜鲁门的博客
10-14 666
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, t
Easy 237题 Delete Node in a Linked List
brenda_zhao的博客
10-26 258
Question: Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third
372. Delete Node in a Linked List【LintCode java】
weixin_30853329的博客
07-14 104
Description Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node. Example Linked list is1->2->3->4, and ...
237--Delete Node In A Linked List
weixin_30328063的博客
08-15 120
package LinedList; public class DeleteNodeInALinkedList{ /** * 解题思路很简单，删除当前节点，那我们把当前节点代替为下一个节点即可。 * 之前的删除节点都是找的其上一个节点，从来没想过有没有其他方法。 * 看来还是要多思考，多问问什么，多尝试。 * @pa...
see-88. Merge Sorted Array
leetcodecl
03-18 1094
利用array1多余的位置，从后向前遍历二个数组： class Solution { public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { int total=m+n-1; m--; n--; ...
see-1. Two Sum
leetcodecl
07-31 416
python版： class Solution: def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ ans = list() ...
see-123. Best Time to Buy and Sell Stock III
leetcodecl
12-24 374
Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions. Note: You may not e...
see-169. Majority Element
leetcodecl
03-03 348
寻找数组中出现次数超过元素个数一半的那个元素：若数组中存在一个元素的累计次数大于元素总个数的一般，那么不断消除数组中二个互异的元素，那么数组中最终剩余的元素即为符合条件的元素。 class Solution { public: int majorityElement(vector<int>& nums) { int flag=1; i...
【位运算】338. Counting Bits
leetcodecl
04-26 295
任意一个整数左移一位后，1的个数不变，而且扩大一倍，变为偶数（末位必定为0），因此偶数中1的个数等于偶数的一半的数中1的个数； 对于奇数而言，末位必定为1，相当于前一位的偶数在末位添加一个'1' vector<int> countBits(int num) { vector<int> table; table.push_back(0);...
b. Write a linked list implementation of self-adjusting lists. by c language
最新发布
10-04
自调整列表（Adaptive Array List），也称为动态数组，是一种数据结构，它结合了链表和数组的优点，能自动调整存储容量以适应元素的增删。在C语言中，我们可以创建一个简单的双向链表实现自调整列表： ```c #include <stdlib.h> typedef struct Node { int data; struct Node* prev; struct Node* next; } Node; typedef struct AdaptiveList { Node* head; Node* tail; int size; int capacity; } AdaptiveList; // 初始化列表 AdaptiveList* init_list() { AdaptiveList* list = (AdaptiveList*)malloc(sizeof(AdaptiveList)); list->head = NULL; list->tail = NULL; list->size = 0; list->capacity = 4; // 初始容量 return list; } // 插入元素到列表尾部 void insert(AdaptiveList* list, int value) { if ((list->size + 1) >= list->capacity) { resize_list(list); // 自动扩容 } Node* newNode = (Node*)malloc(sizeof(Node)); newNode->data = value; newNode->prev = list->tail; newNode->next = NULL; if (list->tail != NULL) { list->tail->next = newNode; } else { list->head = newNode; } list->tail = newNode; list->size++; } // 扩容函数 void resize_list(AdaptiveList* list) { list->capacity *= 2; Node* newTail = (Node*)malloc(sizeof(Node) * list->capacity); newTail->prev = list->tail; newTail->next = NULL; if (list->tail != NULL) { list->tail->next = newTail; } else { list->head = newTail; } list->tail = newTail; } // 删除指定位置的元素 void delete_at(AdaptiveList* list, int index) { if (index >= 0 && index < list->size) { if (index == 0) { if (list->head == list->tail) { free(list->head); list->head = NULL; list->tail = NULL; } else { list->head = list->head->next; list->head->prev = NULL; } } else { Node* current = list->head; for (int i = 0; i < index - 1; i++) { current = current->next; } current->next = current->next->next; if (current->next != NULL) { current->next->prev = current; } } list->size--; } } // 示例操作 void main_example(AdaptiveList* list) { init_list(); insert(list, 1); insert(list, 2); delete_at(list, 0); printf("Size: %d, Capacity: %d\n", list->size, list->capacity); }
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值