每日刷题
翻身的咸鱼ing
这个作者很懒,什么都没留下…
展开
-
每日三题(6)
153. 寻找旋转排序数组中的最小值 class Solution { public: int findMin(vector<int>& nums) { int l = 0, r = nums.size() - 1; if(nums[0] > nums[r]){ while(l != r){ ...原创 2020-04-10 23:08:33 · 95 阅读 · 1 评论 -
每日三题(5)
240.图形打印四 #include <iostream> using namespace std; char str[2200][2200]; int num[10] = {0, 1, 3, 9, 27, 81, 243, 729, 2187}; void func(int x,int y, int n){ if(n == 1){ str[x][y] = '...原创 2020-04-02 01:12:12 · 93 阅读 · 0 评论 -
每日三题(4)
Leetcode112.路径总和 /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) ...原创 2020-03-31 23:17:42 · 138 阅读 · 0 评论 -
每日刷题(3)
题目 Leetcode108.将有序数组转化为二叉搜索树 /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), ...原创 2020-03-29 00:36:28 · 335 阅读 · 2 评论 -
每日三题(2)
题目 Leetcode103.二叉树的锯齿型层次遍历 错误代码 /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL...原创 2020-03-27 18:56:56 · 243 阅读 · 2 评论 -
每日三题(1)
题目 Leetcode100.相同的树 /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NUL...原创 2020-03-27 01:13:53 · 317 阅读 · 2 评论