leetcode 101.Symmetric Tree-对称二叉树|深度遍历

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: 1 ...

2015-10-08 13:11:33

阅读数:1970

评论数:2

leetcode 58.Length of Last Word-最后一个单词长度

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If the last w...

2015-10-08 09:44:03

阅读数:357

评论数:0

leetcode 8.String to Integer (atoi)-字符串转整数

Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see bel...

2015-10-08 00:34:10

阅读数:346

评论数:0

leetcode 70.Climbing Stairs-爬楼梯|动态规划

You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you ...

2015-10-07 13:00:01

阅读数:2724

评论数:0

leetcode 64.Ugly Number-丑数

Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For e...

2015-10-07 10:43:13

阅读数:396

评论数:0

leetcode 242. Valid Anagram

Given two strings s and t, write a function to determine if t is an anagram of s. For example, s = "anagram", t = "nagaram", re...

2015-10-07 00:16:21

阅读数:347

评论数:0

leetcode 283.Move Zeroes-移除0

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, ...

2015-10-06 20:38:32

阅读数:454

评论数:0

leetcode 83.Remove Duplicates from Sorted List-链表去重

Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given ...

2015-10-05 23:40:47

阅读数:1159

评论数:0

leetcode 1. Two Sum

Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two...

2015-10-04 23:23:19

阅读数:458

评论数:0

leetcode 104.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 down to the farthest...

2015-10-04 22:19:28

阅读数:689

评论数:0

leetcode 258.Add Digits | leetcode 258 -数字相加

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is l...

2015-10-04 16:24:41

阅读数:1184

评论数:0

leetcode 66. Plus One-加一

Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is...

2015-10-04 15:20:49

阅读数:1623

评论数:1

Add Binary | leetcode 67 【Java解题报告】

Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Return "100". 代码实现: ...

2015-10-04 14:23:39

阅读数:2220

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭