神奇的萝卜丝

108. 将有序数组转换为二叉搜索树c

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

posted @ 2024-03-21 17:27 神奇的萝卜丝阅读(8) 评论(0) 推荐(0)

669. 修剪二叉搜索树c

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

posted @ 2024-03-21 17:22 神奇的萝卜丝阅读(9) 评论(0) 推荐(0)

450. 删除二叉搜索树中的节点c

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

posted @ 2024-03-21 17:10 神奇的萝卜丝阅读(8) 评论(0) 推荐(0)

236. 二叉树的最近公共祖先c

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

posted @ 2024-03-21 16:57 神奇的萝卜丝阅读(8) 评论(0) 推荐(0)

98. 验证二叉搜索树c

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

posted @ 2024-03-21 16:46 神奇的萝卜丝阅读(8) 评论(0) 推荐(0)

257. 二叉树的所有路径c

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

posted @ 2024-03-21 16:36 神奇的萝卜丝阅读(14) 评论(0) 推荐(0)

485. 最大连续 1 的个数c

摘要： int findMaxConsecutiveOnes(int* nums, int numsSize) { int max=0,index=0,count=0; while(index<numsSize){ if(nums[index]==1){ count++; if(count>max) max 阅读全文

posted @ 2024-03-20 17:08 神奇的萝卜丝阅读(10) 评论(0) 推荐(0)

876. 链表的中间结点c

摘要： /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* middleNode(struct ListNode* 阅读全文

posted @ 2024-03-20 17:06 神奇的萝卜丝阅读(10) 评论(0) 推荐(0)

面试题 17.12. BiNodec

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

posted @ 2024-03-20 17:05 神奇的萝卜丝阅读(7) 评论(0) 推荐(0)

LCR 159. 库存管理 IIIc

摘要： /** * Note: The returned array must be malloced, assume caller calls free(). */ int divide(int* stock,int head,int tail){ int t=stock[head]; while(hea 阅读全文

posted @ 2024-03-20 16:59 神奇的萝卜丝阅读(17) 评论(0) 推荐(0)

llllmz

导航

公告