摘要: 力扣143. 重排链表 1、C /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ void reorderList(struct ListN 阅读全文
posted @ 2023-04-04 20:27 菜鸟冲冲冲 阅读(29) 评论(0) 推荐(0)
摘要: 力扣61. 旋转链表 1、C /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* rotateRight(s 阅读全文
posted @ 2023-03-25 16:18 菜鸟冲冲冲 阅读(26) 评论(0) 推荐(0)
摘要: 力扣92. 反转链表 II 1、C /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* reverseBet 阅读全文
posted @ 2023-03-13 09:13 菜鸟冲冲冲 阅读(24) 评论(0) 推荐(0)
摘要: 力扣206. 反转链表 1、C /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* reverseList( 阅读全文
posted @ 2023-03-09 09:16 菜鸟冲冲冲 阅读(18) 评论(0) 推荐(0)
摘要: 力扣83. 删除排序链表中的重复元素 1、C /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* delet 阅读全文
posted @ 2023-03-05 10:07 菜鸟冲冲冲 阅读(23) 评论(0) 推荐(0)
摘要: 力扣19. 删除链表的倒数第 N 个结点 1、C /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* rem 阅读全文
posted @ 2023-03-01 09:21 菜鸟冲冲冲 阅读(13) 评论(0) 推荐(0)
摘要: 47. 全排列 II 1、C /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both r 阅读全文
posted @ 2023-02-25 09:50 菜鸟冲冲冲 阅读(17) 评论(0) 推荐(0)
摘要: 力扣40. 组合总和 II 1、C void back(int* candidates, int candidatesSize, int target,int start,int *path,int *pathSize,int **result,int** returnColumnSizes,int 阅读全文
posted @ 2022-12-15 12:48 菜鸟冲冲冲 阅读(36) 评论(0) 推荐(0)
摘要: 力扣46.全排列 1、C /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both ret 阅读全文
posted @ 2022-11-25 12:45 菜鸟冲冲冲 阅读(38) 评论(0) 推荐(0)
摘要: https://blog.csdn.net/weixin_62023527/article/details/126421991 阅读全文
posted @ 2022-10-27 13:55 菜鸟冲冲冲 阅读(10) 评论(0) 推荐(0)