摘要:
1 /* 2 struct ListNode { 3 int val; 4 struct ListNode *next; 5 ListNode(int x) : val(x), next(NULL) {} 6 };*/ 7 class Partition { 8 public: 9 ListNode 阅读全文
摘要:
1 /* 2 struct ListNode { 3 int val; 4 struct ListNode *next; 5 ListNode(int x) : val(x), next(NULL) {} 6 };*/ 7 //将当前节点的后继节点的数据复制到当前节点,删除后继节点 8 class 阅读全文
摘要:
1 /* 2 struct ListNode { 3 int val; 4 struct ListNode *next; 5 ListNode(int x) : 6 val(x), next(NULL) { 7 } 8 };*/ 9 class Solution { 10 public: 11 Li 阅读全文
摘要:
1 //无论分割点在何处,s2总是s1S1的子串 2 class ReverseEqual { 3 public: 4 bool checkReverseEqual(string s1, string s2) { 5 // write code here 6 int len1 = s1.length 阅读全文