qiujiahao123的博客

//单例设计模式class Solution {public: /** * @return: The same instance of this class every time */ static Solution* getInstance() { // write your code here if(pInstance ==

原题地址:http://www.lintcode.com/zh-cn/problem/binary-tree-maximum-node/#class Solution {public: /** * @param root the root of binary tree * @return the max node */ Solution(){

原地址:http://www.lintcode.com/zh-cn/problem/remove-linked-list-elements//** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(

/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left = this->right =

Hash表思路，时间复杂度为O(n),附加空间复杂度O(n)class Solution {public: /* * @param A: a string * @param B: a string * @return: a boolean */ //思路:将字符串中的每一个值映射到hash表中,统计出现次数，然后比较是否相等 boo

/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left = this->right =