1 Star 0 Fork 0

唐梓迅/leetcode题解

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
.剑指offer35 862 Bytes
一键复制 编辑 原始数据 按行查看 历史
唐梓迅 提交于 2022-03-09 22:54 +08:00 . add .剑指offer35.
struct Node* copyRandomList(struct Node* head) {
if (head == NULL) {
return NULL;
}
for (struct Node* node = head; node != NULL; node = node->next->next) {
struct Node* nodeNew = malloc(sizeof(struct Node));
nodeNew->val = node->val;
nodeNew->next = node->next;
node->next = nodeNew;
}
for (struct Node* node = head; node != NULL; node = node->next->next) {
struct Node* nodeNew = node->next;
nodeNew->random = (node->random != NULL) ? node->random->next : NULL;
}
struct Node* headNew = head->next;
for (struct Node* node = head; node != NULL; node = node->next) {
struct Node* nodeNew = node->next;
node->next = node->next->next;
nodeNew->next = (nodeNew->next != NULL) ? nodeNew->next->next : NULL;
}
return headNew;
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Java
1
https://gitee.com/Tang-CMer/leetcode-problem-solving.git
git@gitee.com:Tang-CMer/leetcode-problem-solving.git
Tang-CMer
leetcode-problem-solving
leetcode题解
master

搜索帮助