码迷,mamicode.com
首页 >  
搜索关键字:通过率    ( 306个结果
leetcode------Balanced Binary Tree
标题:Balanced Binary Tree通过率:32.3%难度:简单Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is define...
分类:其他好文   时间:2014-12-18 14:50:55    阅读次数:186
leetcode------Remove Duplicates from Sorted Array
标题:Remove Duplicates from Sorted Array通过率:31.9%难度简单Given a sorted array, remove the duplicates in place such that each element appear onlyonceand retu...
分类:其他好文   时间:2014-12-18 14:49:05    阅读次数:175
leetcode----------Reverse Integer
题目Reverse Integer通过率34.2%难度EasyReverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321click to show spoilers.Have you ...
分类:其他好文   时间:2014-12-18 13:30:17    阅读次数:134
leetcode------Remove Element
标题:Remove Element通过率:32.6%难度:简单Given an array and a value, remove all instances of that value in place and return the new length.The order of elements...
分类:其他好文   时间:2014-12-17 12:30:18    阅读次数:157
leetcode------Merge Two Sorted Lists
标题:Merge Two Sorted Lists通过率:33.1%难度:简单Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the...
分类:其他好文   时间:2014-12-17 12:15:01    阅读次数:196
leetcode------Climbing Stairs
标题:Climbing Stairs通过率:34%难度:简单You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how ma...
分类:其他好文   时间:2014-12-17 12:14:26    阅读次数:131
leetcode------Roman to Integer
标题:Roman to Integer通过率:34.1%难度:简单Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.这个题整体不是很难,就...
分类:其他好文   时间:2014-12-15 23:24:40    阅读次数:211
leetcode------Remove Duplicates from Sorted List
标题:Remove Duplicates from Sorted List通过率:34.5难度:简单Given a sorted linked list, delete all duplicates such that each element appear onlyonce.For example...
分类:其他好文   时间:2014-12-15 23:23:12    阅读次数:207
leetcode----------Binary Tree Level Order Traversal II
题目 Binary Tree Level Order Traversal II通过率30.6%难度EasyGiven a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from ...
分类:其他好文   时间:2014-12-13 23:17:56    阅读次数:150
leetcode----------Pow(x, n)
题目Pow( x, n)通过率26.2%难度MediumImplement pow(x,n). 初步构想:开始拿到题目就以为是简单的求幂运算,一直迭代乘法就可以了,事实证明,想法过于简单!!结果自己给自己挖了个坑,根本没有考虑到数的大小以及溢出的问题,自己默认n为正数了,要注意幂指数为负数的情况是....
分类:其他好文   时间:2014-12-13 17:49:18    阅读次数:211
306条   上一页 1 ... 26 27 28 29 30 31 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!