
C++;leetcode
文章平均质量分 52
小小木易
互联网金融服务器端开发
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
leetcode之Merge Two Binary Trees
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge them into a new binary tr原创 2017-09-26 10:01:30 · 200 阅读 · 0 评论 -
leetcode之 Array Partition I
Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large a原创 2017-09-26 19:23:43 · 233 阅读 · 0 评论 -
leetcode 之Remove Element
Given an array and a value, remove all instances of that value in place and return the new length. Do not allocate extra space for another array, you must do this in place with constant memory.原创 2017-09-20 19:36:59 · 176 阅读 · 0 评论 -
leetcode之 Judge Route Circle
题目很简单:本质上就是判断上下左右的次数是否相等 class Solution { public: bool judgeCircle(string moves) { int up_count =0; int dow_count =0; int r_count=0; int l_count=0;原创 2017-10-29 18:53:50 · 274 阅读 · 0 评论