<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Celine_Chan的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/Celine_Chan</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; Celine_Chan]]></copyright><item><title><![CDATA[面试题55 - I. 二叉树的深度]]></title><link>https://blog.csdn.net/Celine_Chan/article/details/104397628</link><guid>https://blog.csdn.net/Celine_Chan/article/details/104397628</guid><author>Celine_Chan</author><pubDate>Wed, 19 Feb 2020 18:03:54 +0800</pubDate><description><![CDATA[/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
 //递归
int maxDepth(struct TreeNode* root){
    //...]]></description><category></category></item><item><title><![CDATA[面试题17. 打印从1到最大的n位数]]></title><link>https://blog.csdn.net/Celine_Chan/article/details/104396628</link><guid>https://blog.csdn.net/Celine_Chan/article/details/104396628</guid><author>Celine_Chan</author><pubDate>Wed, 19 Feb 2020 17:16:40 +0800</pubDate><description><![CDATA[/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* printNumbers(int n, int* returnSize) {
    int size = pow(10.0, n) - 1;
    int *result = (int *)malloc(sizeof(i...]]></description><category></category></item></channel></rss>