Leetcode 237. Delete Node in a Linked List
来源:互联网 发布:mac osx 切换root 编辑:程序博客网 时间:2024/06/10 15:36
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 value3
, the linked list should become1 -> 2 -> 4
after calling your function.
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: void deleteNode(ListNode* node) { ListNode* nextnode=node->next; node->val = nextnode->val; node->next = nextnode->next; //node->next = NULL; }};
原本我是想直接复制的:node=node->next;就是用“=”将结构体直接复制,但是出错了,
于是我查询资料发现这样不对,虽然在网上看到有些人用memcpy()函数直接复制,可是这样也不是完全正确的;
下面是我对memcpy()函数的理解,仅供参考。
void * memcpy ( void * dest, const void * src, size_t num );
可知memcpy是复制内存地址,而不是复制具体的值,memcpy会按字节复制,所以如果dest和src所指向的有效内存不一致就会出错
0 0
- leetcode: Delete Node in a Linked List
- LeetCode Delete Node in a Linked List
- 【leetcode】Delete Node in a Linked List
- Leetcode: Delete Node in a Linked List
- [LeetCode]Delete Node in a Linked List
- 【leetcode】Delete Node in a Linked List
- Leetcode Delete Node in a Linked List
- LeetCode || Delete Node in a Linked List
- [LeetCode] Delete Node in a Linked List
- LeetCode-Delete Node in a Linked List
- 【leetCode】Delete Node In A Linked List
- [leetcode] Delete Node in a Linked List
- [LeetCode]Delete Node in a Linked List
- [leetcode]Delete Node in a Linked List
- Leetcode: Delete Node in a Linked List
- LeetCode Delete Node in a Linked List
- LeetCode-Delete Node in a Linked List
- leetcode | Delete Node in a Linked List
- hustoj 昂贵的聘礼
- Javascript复习第三天动态显示时间
- 1022
- NYOJ 27 水池数目(深搜)
- redis学习笔记(18)---事件
- Leetcode 237. Delete Node in a Linked List
- gdb 调试利器
- Tableau Desktop简单介绍
- 快速排序2
- 常量和变量
- matlab 二进制文件的读取fead,节约内存
- Python的GIL是什么鬼,多线程性能究竟如何
- hdu2544 最短路
- 51单片机定时器精度问题之一