码字不易,对你有帮助 点赞/转发/关注 支持一下作者
微信搜公众号:不会编程的程序圆
看更多干货,获取第一时间更新
【1200 题】系列 Github :https://github.com/hairrrrr/1200_Problem
推荐阅读原文:
https://mp.weixin.qq.com/s/JJrPxiCKEVnYB8vuUlQEug
文章目录
0022 环形链表 II
- https://leetcode-cn.com/problems/linked-list-cycle-ii/
给定一个链表,返回链表开始入环的第一个节点。 如果链表无环,则返回 null。
为了表示给定链表中的环,我们使用整数 pos 来表示链表尾连接到链表中的位置(索引从 0 开始)。 如果 pos 是 -1,则在该链表中没有环。
说明:不允许修改给定的链表。
C 解法:
快慢指针法:
解法讲解:https://leetcode-cn.com/problems/linked-list-cycle-ii/solution/linked-list-cycle-ii-kuai-man-zhi-zhen-shuang-zhi-/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode *detectCycle(struct ListNode *head) {
struct ListNode* fast = head, *slow = head;
while(1){
if(fast == NULL || fast->next == NULL)
return NULL;
fast = fast->next->next;
slow = slow->next;
if(fast == slow)
break;
}
fast = head;
while(fast != slow){
fast = fast->next;
slow = slow->next;
}
return fast;
}
0023 数组形式的整数加法
https://leetcode-cn.com/problems/add-to-array-form-of-integer/
C :
解法:https://leetcode-cn.com/problems/add-to-array-form-of-integer/solution/shu-zu-xing-shi-de-zheng-shu-jia-fa-by-leetcode/
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* addToArrayForm(int* A, int ASize, int K, int* returnSize){
int i, j, AddSize;
int a[4] = {
0}; // K 只有 5 位且 A 数组大小至少为 1
int* newArr;
i = ASize - 1;
while(K != 0 && i >= 0){
K = A[i] + K;
A[i] = K % 10;
K /= 10;
i--;
}
// 如果 K == 0,说明没有进位问题且A数组大小够用
if(K == 0){
*returnSize = ASize;
return A;
}
// A数组大小不够用,需要扩容
// 我的思路是:先将多余的位从低位到高位存储在数组a中;然后malloc一个合适大小的数组,将a中的位按从高到低存储在新数组中,然后再将A中的位复制到新数组中
i = 0;
while(K != 0){
a[i++] = K % 10;
K /= 10;
}
AddSize = i;
newArr = (int*)malloc(sizeof(int) * (AddSize + ASize));
for(i = AddSize - 1, j = 0; i >= 0; i--, j++)
newArr[j] = a[i];
for(i = 0; i < ASize; i++, j++)
newArr[j] = A[i];
*returnSize = AddSize + ASize;
return newArr;
}
0024 复制带随机指针的链表
https://leetcode-cn.com/problems/copy-list-with-random-pointer/
**C **
解法:https://leetcode-cn.com/problems/copy-list-with-random-pointer/solution/fu-zhi-dai-sui-ji-zhi-zhen-de-lian-biao-by-leetcod/
/**
* Definition for a Node.
* struct Node {
* int val;
* struct TreeNode *next;
* struct TreeNode *random;
* };
*/
struct Node* copyRandomList(struct Node* head) {
if(head == NULL)
return NULL;
struct Node* orig_node, *clone_node, *newHead;
// 1. 复制结点
orig_node = head;
while(orig_node != NULL){
clone_node = (struct Node*)malloc(sizeof(struct Node));
clone_node->val = orig_node->val;
clone_node->next = orig_node->next;
orig_node->next = clone_node;
orig_node = clone_node->next;
}
// 2. 复制随机指针
orig_node = head;
while(orig_node != NULL){
orig_node->next->random = (orig_node->random == NULL) ? NULL : orig_node->random->next;
orig_node = orig_node->next->next;
}
// 3. 拆链
orig_node = head;
clone_node = orig_node->next;
newHead = clone_node;
while(orig_node !=