qq_51681435的博客

1.链表回文结构 /* struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) {} };*/ class PalindromeList { public: bool chkPalindrome(ListNode* A) { // write code here if(A==nullptr&&A->nex

1.移除链表元素 解： /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* removeElements(struct ListNode* head, int val){ //思想：双指针 struct ListNode*prev,*cur; prev=NULL; cur=he