阳光明媚

Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value. /** 用递归的方法

Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using ext

Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements fro

leetcode 题解。 我自己的解法，可能会有不足，欢迎指点。

原题https://leetcode.com/problems/remove-nth-node-from-end-of-list/ 这道题的要求是删除链表中的倒数第n个元素（n总是有效的），不过要求遍历1次链表。 因为要找到倒数第n个，那么删除的数距离最后一个数的间距就是n，需要引入间隔n的2个指针left 和right， 先用快指针right从头后移n次，这样left 

原题连接https://leetcode.com/problems/reverse-words-in-a-string/ Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". Up

leetcode 题解。 我自己的解法，可能会有不足，欢迎指点。

原题链接: http://oj.leetcode.com/problems/remove-element/  题目：Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It do

原题连接 https://leetcode.com/problems/rotate-array/ Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,

leetcode 题解。 我自己的解法，可能会有不足，欢迎指点。

leetcode 题解。 我自己的解法，可能会有不足，欢迎指点。

原题连接：https://leetcode.com/problems/maximum-depth-of-binary-tree/ Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node d