![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
文章平均质量分 53
txdzdlxx
这个作者很懒,什么都没留下…
展开
-
leetcode #102Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20原创 2015-04-22 19:40:19 · 404 阅读 · 0 评论 -
leetcode #1 two sum
#include #include #include #include using namespace std; class Solution { public: static bool cmp(pair &p1,pair &p2){ return p1.first<p2.first;} vector twoSum(vector &numbers, int target) { v原创 2015-04-16 20:17:46 · 351 阅读 · 0 评论