2018年8月14日
Leetcode-890 可能的二分法
摘要： 1 struct UnionFindSet 2 { 3 int *ID; 4 int *Auxiliary; 5 int GroupSum; 6 int WeightOriginalTotal; 7 }; 8 9 struct UnionFindSet* UnionFindSetInit(int WeightTotal) 1... 阅读全文
posted @ 2018-08-14 20:49 Asurudo 阅读(346) 评论(0) 推荐(0)
Leetcode-888 两句话中的不常见单词
摘要： 1 class Solution 2 { 3 public: 4 vector uncommonFromSentences(string A, string B) 5 { 6 map A_store,B_store; 7 string A_words,B_words; 8 ... 阅读全文
posted @ 2018-08-14 20:48 Asurudo 阅读(290) 评论(0) 推荐(0)
Leetcode-392 Is Subsequence(判断子序列)
摘要： 1 class Solution 2 { 3 public: 4 bool isSubsequence(string s, string t) 5 { 6 vector WordList[26]; 7 for(int i = 0;i < t.size();i ++) 8 ... 阅读全文
posted @ 2018-08-14 20:44 Asurudo 阅读(299) 评论(0) 推荐(0)
判断两二叉树是否完全相同
摘要： 1 #include 2 #include 3 #include 4 5 typedef int ElementType; 6 7 struct BinarySearchTreeNode 8 { 9 ElementType Element; 10 struct BinarySearchTreeNode *Left; 11 struct Bin... 阅读全文
posted @ 2018-08-14 13:35 Asurudo 阅读(245) 评论(0) 推荐(0)