摘要：
leetcode 226 Invert Binary Tree递归方法/** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * stru... 阅读全文
摘要：
LeetCode 283 Move Zeroesvoid moveZeroes(int* nums, int numsSize) { int i=0,j=0; for(i;ij) j=i; }} 阅读全文
摘要：
LeetCode 100 Same Tree递归方法：/** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeN... 阅读全文
摘要：
LeetCode 237 Delete Node in a Linked List/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * };... 阅读全文
摘要：
LeetCode 104 Maximum Depth of Binary Treehttps://leetcode.com/problems/maximum-depth-of-binary-tree//** * Definition for a binary tree node. * struct ... 阅读全文