AC算法每日打卡删除链表的节点正则表达式匹配

剑指 Offer 18. 删除链表的节点

class Solution {
public:ListNode* deleteNode(ListNode* head, int val) {ListNode* new_head &＃61; new ListNode(0);new_head->next &＃61; head;ListNode* cur &＃61; head;ListNode* ptr &＃61; new_head;while (cur !&＃61; NULL && cur->val !&＃61; val) {ptr &＃61; cur;cur &＃61; cur->next;}ptr->next &＃61; cur->next;return new_head->next;}
};

剑指 Offer 19. 正则表达式匹配

class Solution {
public:bool isMatch(string s, string p) {if(p.empty()) return s.empty();bool match&＃61;!s.empty()&&(s[0]&＃61;&＃61;p[0] || p[0]&＃61;&＃61;&＃39;.&＃39;);if(p.length()>&＃61;2 && p[1]&＃61;&＃61;&＃39;*&＃39;){return isMatch(s,p.substr(2)) || match && isMatch(s.substr(1),p);}else{if(match)return isMatch(s.substr(1),p.substr(1));elsereturn false;}}
};