摘要:
Iclass Solution {public: ListNode *deleteDuplicates(ListNode *head) { if(head==NULL)return NULL; ListNode *p=head; while(p&&p->next) { ListNode *q=p->next; if(q->val==p->val) { if(q->next) { p->... 阅读全文
摘要:
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:vector<int>v1;vector<vector<int>>v;int countsum; vector<vector<int> > pathSum(TreeNo 阅读全文