github_29989383的博客

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

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

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.

题目很简单：本质上就是判断上下左右的次数是否相等 class Solution { public:     bool judgeCircle(string moves) {         int up_count =0;         int dow_count =0;         int r_count=0;         int l_count=0;