leetcode
关注
分享
扫一扫
xiaoxiaoniaoge
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
252. Meeting Rooms
class Solution { public: static bool compare1(vector<int> & a, vector<int>& b){ return a[0] < b[0]; } bool canAttendMeetings(vector<vector<in...原创 2019-09-11 17:37:58 · 134 阅读 · 0 评论 -
270. Closest Binary Search Tree Value
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ clas...原创 2019-09-11 17:42:03 · 141 阅读 · 0 评论 -
298. Binary Tree Longest Consecutive Sequence
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ clas...原创 2019-09-11 17:40:40 · 129 阅读 · 0 评论 -
270. Closest Binary Search Tree Value
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ clas...原创 2019-09-11 17:39:53 · 148 阅读 · 0 评论 -
253. Meeting Rooms II
class Solution { public: static bool compare1(vector<int> & v1, vector<int>& v2){ return v1[0] < v2[0]; } int minMeetingRooms(vector<vector<i...原创 2019-09-11 17:38:41 · 120 阅读 · 0 评论 -
最小生成树
https://blog.youkuaiyun.com/C2681595858/article/details/84104688原创 2019-09-18 11:38:18 · 240 阅读 · 0 评论