llllmz

摘要： C语言字符串细节真多啊，搞了好久。 /** * Note: The returned array must be malloced, assume caller calls free(). */ char c[10][5]={" "," ","abc","def","ghi","jkl","mno" 阅读全文

摘要： /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array a 阅读全文

摘要： 回溯其实就是抽象图的遍历过程 这题数据实在太离谱了。 /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * 阅读全文

摘要： 右根左遍历就行。 /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ void order 阅读全文

摘要： 如果按一般思路建一个平衡二叉树，非常麻烦。 但是二分查找树就一个平衡二叉树，所有构建二叉查找树就行。 /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * 阅读全文

摘要： 这题还是很难得。一看是想着当作普通二叉树所有节点都递归，但是很难做，难度很高。 /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct Tree 阅读全文

摘要： 这题特别好，和递归删除链表里的元素有异曲同工之妙 /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * 阅读全文

摘要： /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ struct TreeNode* in 阅读全文

摘要： /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ struct TreeNode* pr 阅读全文

摘要： 思想就是层次遍历，然后判断每个节点是否为父节点、 /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * 阅读全文