摘要：
// language C with STL(C++) // 剑指62 // https://leetcode-cn.com/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/ class Solution { public: int 阅读全文
摘要：
// language c // 剑指43 // https://leetcode-cn.com/problems/1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof/ int countDigitOne(int n){ if(n==0) return 0; if( 阅读全文
摘要：
// language c // 剑指33 // https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/ bool verifyPostorder(int* postorder, int p 阅读全文
摘要：
学东西，总结下flag都做了哪些，维护一个想做的事的清单，然后设置下个月的flag 备份一下此微博，然后发到邮件和q群里备份一下 阅读全文
摘要：
// language c // 剑指32-I // https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/ /** * Definition for a binary tree node. * stru 阅读全文
摘要：
// language c // 剑指64 // https://leetcode-cn.com/problems/qiu-12n-lcof/ int sumNums(int n){ int ans = n; (n) &&(ans +=sumNums(n-1)); return ans; } 阅读全文
摘要：
// language c // 剑指60 // https://leetcode-cn.com/problems/nge-tou-zi-de-dian-shu-lcof/ /** * Note: The returned array must be malloced, assume caller 阅读全文
摘要：
// language c // 剑指04 // https://leetcode-cn.com/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/ bool findNumberIn2DArray(int** matrix, int matrixSize, 阅读全文
摘要：
// language c // 剑指14-II // https://leetcode-cn.com/problems/jian-sheng-zi-ii-lcof/ // 操蛋的一题，妈的 int cuttingRope(int n){ if(n<=3) return n-1; if(n==4) 阅读全文
摘要：
// language c // 剑指46 // https://leetcode-cn.com/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof/ int translateNum(int num){ // 递归 if(num<10) return 阅读全文