leetcode链表专题
就叫温华啦
这个作者很懒,什么都没留下…
展开
-
leetcode 链表专题 - 判断有环
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: bool hasCyc...原创 2019-03-22 09:13:06 · 113 阅读 · 0 评论 -
leetcode链表专题- 得到入环节点
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *d...原创 2019-03-22 09:13:57 · 178 阅读 · 0 评论 -
leetcode-链表专题- 取两单链表的交叉节点
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *g...原创 2019-03-22 09:14:44 · 184 阅读 · 0 评论 -
leetcode链表专题- 移除但链表的倒数第n个节点
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* r...原创 2019-03-22 09:15:31 · 109 阅读 · 0 评论 -
leetcode链表专题- 反转单链表
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* r...原创 2019-03-22 09:16:08 · 185 阅读 · 0 评论 -
leetcote链表专题- 移除链表中的所有目标元素值
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* r...原创 2019-03-22 09:16:55 · 100 阅读 · 0 评论 -
leetcode链表专题 oddEvenList 奇偶链表
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* o...原创 2019-03-22 09:17:57 · 260 阅读 · 0 评论 -
leetcode 链表专题 -判断是否为回文链表
#include<iostream>using namespace std; //Definition for singly-linked list. struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(nullptr) {} }; cl...原创 2019-03-22 09:18:50 · 393 阅读 · 0 评论