随笔分类 -  链和栈

摘要:题目地址:https://leetcode-cn.com/problems/palindrome-linked-list/ 解题思路: 用一个数组装; class Solution { public: bool isPalindrome(ListNode* head) { ListNode *q; 阅读全文
posted @ 2020-10-23 16:17 CCxiao5 阅读(58) 评论(0) 推荐(0)
摘要:题目地址:https://leetcode-cn.com/problems/reverse-nodes-in-k-group/ 解题思路:增加头结点,通过头结点来实现倒序。 class Solution { public: ListNode* reverseKGroup(ListNode* head 阅读全文
posted @ 2020-10-12 18:45 CCxiao5 阅读(71) 评论(0) 推荐(0)
摘要:题目地址:https://leetcode-cn.com/problems/swap-nodes-in-pairs/ 解题思路:注意head是首元结点不是头结点。 class Solution { public: ListNode* swapPairs(ListNode* head) { ListN 阅读全文
posted @ 2020-08-14 14:44 CCxiao5 阅读(101) 评论(0) 推荐(0)
摘要:题目地址:https://leetcode-cn.com/problems/merge-k-sorted-lists/ 解题思路:简单的分治算法 /** * Definition for singly-linked list. * struct ListNode { * int val; * Lis 阅读全文
posted @ 2020-08-14 14:23 CCxiao5 阅读(76) 评论(0) 推荐(0)
摘要:题目地址:https://leetcode-cn.com/problems/merge-two-sorted-lists/ 解题思路:简单链表操作 class Solution { public: ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) 阅读全文
posted @ 2020-08-06 15:26 CCxiao5 阅读(98) 评论(0) 推荐(0)
摘要:题目地址:https://leetcode-cn.com/problems/valid-parentheses/ 解题思路:栈的操作 class Solution { public: bool isValid(string s) { stack<char> q; for (int i = 0; i 阅读全文
posted @ 2020-08-06 15:11 CCxiao5 阅读(98) 评论(0) 推荐(0)
摘要:题目地址:https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/ 解题思路:题目要求一次遍历,设置双指针,通过第二个指针来判断是否第一个指针到达倒数第n个。 class Solution { public: ListNod 阅读全文
posted @ 2020-08-06 15:01 CCxiao5 阅读(74) 评论(0) 推荐(0)