随笔分类 -  leetcode

摘要：``` int bulbSwitch(int n) { return (int)sqrt(n); } ``` 阅读全文

摘要：``` /** * Return an array of size *returnSize. * Note: The returned array must be malloced, assume caller calls free(). */ int* singleNumber(int* nums, int numsSize, int* returnSize) { int xor ... 阅读全文

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

摘要：``` /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ bool isSameTree(struct TreeNode* p, struct Tre... 阅读全文

摘要：``` void moveZeroes(int* nums, int numsSize) { //int zeros = 0; for(int i = numsSize-1;i >= 0;i--){ if(nums[i] == 0){ for(int j = i;j < numsSize-1;j++){ num... 阅读全文

摘要：``` /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ void deleteNode(struct ListNode* node) { struct ListNode* temp = node->ne... 阅读全文

摘要：``` /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ int maxDepth(struct TreeNode* root) { if(r... 阅读全文

摘要：``` int addDigits(int num) { return (num != 0 && num%9 == 0)?9:num%9; } ``` 阅读全文

摘要：这道题传统递归在leetcode上会超时，不过我觉得传统思路还是可以保留的。 数学方法 传统递归 阅读全文