摘要: class Solution { public: int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) { int left = max(A,E), right = max(min(C,G), left); int bottom = max(B,F), top = max(min(D,H), bottom); 阅读全文
posted @ 2019-08-09 00:17 有梦就要去实现他 阅读(131) 评论(0) 推荐(0) 编辑
摘要: class Solution { public: vector> findLeaves(TreeNode* root) { vector> res; while (root) { vector leaves; root = remove(root, leaves); res.p... 阅读全文
posted @ 2019-08-09 00:15 有梦就要去实现他 阅读(163) 评论(0) 推荐(0) 编辑