E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
given
Flatten Binary Tree to Linked List
阅读更多Givenabinarytree,flattenittoalinkedlistin-place.Forexample,
Given
1/\25/\\346Theflattenedtreeshouldlooklike
KickCode
·
2016-02-09 05:00
二叉树
链表
Flatten Binary Tree to Linked List
Givenabinarytree,flattenittoalinkedlistin-place.Forexample,
Given
1 /\ 2 5 / \
KickCode
·
2016-02-09 05:00
链表
二叉树
Flatten Binary Tree to Linked List
阅读更多Givenabinarytree,flattenittoalinkedlistin-place.Forexample,
Given
1/\25/\\346Theflattenedtreeshouldlooklike
KickCode
·
2016-02-09 05:00
二叉树
链表
Unique Binary Search Trees
Given
n,howmanystructurallyunique BST's (binarysearchtrees)thatstorevalues1...n?
walkwalkwalk
·
2016-02-08 16:00
[LeetCode] Missing Ranges 缺失区间
Givenasortedintegerarraywheretherangeofelementsare[0,99]inclusive,returnitsmissingranges.Forexample,
given
Grandyang
·
2016-02-08 07:00
First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,
Given
[1,2,0] return 3,and
walkwalkwalk
·
2016-02-07 15:00
HDOJ 1003 Max Sum
ProblemDescriptionGivenasequencea[1],a[2],a[3]……a[n],yourjobistocalculatethemaxsumofasub-sequence.Forexample,
given
qq_26525215
·
2016-02-06 13:00
leetcode - Trapping Rain Water
Given
n non-negativeintegersrepresentinganelevationmapwherethewidthofeachbaris1,computehowmuchwateritisabletotrapafterraining.Forexample
mengfanrong
·
2016-02-06 10:00
Reverse Linked List II
Reversealinkedlistfrompositionmton.Doitin-placeandinone-pass.Forexample:
Given
1->2->3->4->5->NULL,m=2andn
KickCode
·
2016-02-06 05:00
java
链表
24. Swap Nodes in Pairs
Givenalinkedlist,swapeverytwoadjacentnodesandreturnitshead.Forexample,
Given
1->2->3->4,youshouldreturnthelistas2
偏爱纯白色
·
2016-02-05 21:00
LeetCode 260. Single Number III
inwhichexactlytwoelementsappearonlyonceandalltheotherelementsappearexactlytwice.Findthetwoelementsthatappearonlyonce.Forexample:
Given
leonard1853
·
2016-02-04 21:51
LeetCode
算法
面试
Partition List
partitionitsuchthatallnodeslessthanxcomebeforenodesgreaterthanorequaltox.Youshouldpreservetheoriginalrelativeorderofthenodesineachofthetwopartitions.Forexample,
Given
1
KickCode
·
2016-02-04 21:50
链表
Remove Duplicates from Sorted List
Givenasortedlinkedlist,deleteallduplicatessuchthateachelementappearonlyonce.Forexample,
Given
1->1->2,return1
KickCode
·
2016-02-04 21:49
java
链表
Remove Duplicates from Sorted List II
Givenasortedlinkedlist,deleteallnodesthathaveduplicatenumbers,leavingonlydistinctnumbersfromtheoriginallist.Forexample,
Given
1
KickCode
·
2016-02-04 21:11
去重
链表
[LeetCode] Read N Characters
Given
Read4 II - Call multiple times 用Read4来读取N个字符之二 - 多次调用
TheAPI:intread4(char*buf)reads4charactersatatimefromafile.Thereturnvalueistheactualnumberofcharactersread.Forexample,itreturns3ifthereisonly3charactersleftinthefile.Byusingtheread4API,implementthefun
Grandyang
·
2016-02-04 15:00
[LeetCode] Read N Characters
Given
Read4 II - Call multiple times 用Read4来读取N个字符之二 - 多次调用
TheAPI:intread4(char*buf)reads4charactersatatimefromafile.Thereturnvalueistheactualnumberofcharactersread.Forexample,itreturns3ifthereisonly3charactersleftinthefile.Byusingtheread4API,implementthefun
Grandyang
·
2016-02-04 15:00
[leetcode] 179. Largest Number 解题报告
largest-number/Givenalistofnonnegativeintegers,arrangethemsuchthattheyformthelargestnumber.Forexample,
given
qq508618087
·
2016-02-04 07:00
LeetCode
快速排序
sort
Remove Duplicates from Sorted List II
Givenasortedlinkedlist,deleteallnodesthathaveduplicatenumbers,leavingonlydistinctnumbersfromtheoriginallist.Forexample,
Given
1
KickCode
·
2016-02-04 01:00
链表
去重
Remove Duplicates from Sorted List II
Givenasortedlinkedlist,deleteallnodesthathaveduplicatenumbers,leavingonlydistinctnumbersfromtheoriginallist.Forexample,
Given
1
KickCode
·
2016-02-04 01:00
链表
去重
Groupon面经Prepare: Sort
given
a range && Summary: Bucket Sort
首先是如何sort一个只有0和1的数组，要求inplace.followup是告诉一个range，如何在O(N)时间内sort好两个pointer可解1packageSorting; 2importjava.util.*; 3 4publicclassInplaceSorting{ 5publicvoidsorting(int[]arr){ 6if(arr==null||arr.leng
neverlandly
·
2016-02-04 01:00
Groupon面经Prepare: Sort
given
a range && Summary: Bucket Sort
首先是如何sort一个只有0和1的数组，要求inplace.followup是告诉一个range，如何在O(N)时间内sort好两个pointer可解1packageSorting; 2importjava.util.*; 3 4publicclassInplaceSorting{ 5publicvoidsorting(int[]arr){ 6if(arr==null||arr.leng
neverlandly
·
2016-02-04 01:00
[LeetCode118]Pascal's Triangle
题目:
Given
numRows,generatethefirst numRows ofPascal'striangle.Forexample,
given
numRows =5,Return[ [1]
薛定谔的喵
·
2016-02-03 16:00
[LeetCode118]Pascal's Triangle
题目:
Given
numRows,generatethefirst numRows ofPascal'striangle.Forexample,
given
numRows =5,Return[ [1]
薛定谔的喵
·
2016-02-03 16:00
[LeetCode228]Summary Ranges
题目：Givenasortedintegerarraywithoutduplicates,returnthesummaryofitsranges.Forexample,
given
[0,1,2,4,5,7
薛定谔的喵
·
2016-02-03 16:00
[LeetCode228]Summary Ranges
题目：Givenasortedintegerarraywithoutduplicates,returnthesummaryofitsranges.Forexample,
given
[0,1,2,4,5,7
薛定谔的喵
·
2016-02-03 16:00
[LeetCode119]Pascal's Triangle II
题目：Givenanindex k,returnthe kth rowofthePascal'striangle.Forexample,
given
k =3,Return [1,3,3,1].Note:
薛定谔的喵
·
2016-02-03 16:00
[LeetCode119]Pascal's Triangle II
题目：Givenanindex k,returnthe kth rowofthePascal'striangle.Forexample,
given
k =3,Return [1,3,3,1].Note:
薛定谔的喵
·
2016-02-03 16:00
Behave + Selenium(Python) 二
介绍feature,py文件和之间关系：example01.feature文件包括5行:Feature行：介绍这个feature用来干什么的；Scenario行：介绍这个scenario用来干什么的；
Given
liucx
·
2016-02-03 15:00
Behave + Selenium(Python) 二
介绍feature,py文件和之间关系：example01.feature文件包括5行:Feature行：介绍这个feature用来干什么的；Scenario行：介绍这个scenario用来干什么的；
Given
liucx
·
2016-02-03 15:00
[leetcode]@python 83. Remove Duplicates from Sorted List
remove-duplicates-from-sorted-list/题目原文Givenasortedlinkedlist,deleteallduplicatessuchthateachelementappearonlyonce.Forexample,
Given
1
slurm
·
2016-02-03 13:00
[leetcode]@python 83. Remove Duplicates from Sorted List
remove-duplicates-from-sorted-list/题目原文Givenasortedlinkedlist,deleteallduplicatessuchthateachelementappearonlyonce.Forexample,
Given
1
slurm
·
2016-02-03 13:00
图与最短路径
举个例子如下：
Given
: A="hit" B="cog" Dict=["hot","dot","dog","lot","log"]Return [ ["hit",
康杜
·
2016-02-03 00:09
[leetcode] @python 82. Remove Duplicates from Sorted List II
Givenasortedlinkedlist,deleteallnodesthathaveduplicatenumbers,leavingonlydistinctnumbersfromtheoriginallist.Forexample,
Given
slurm
·
2016-02-02 22:00
[leetcode] @python 82. Remove Duplicates from Sorted List II
Givenasortedlinkedlist,deleteallnodesthathaveduplicatenumbers,leavingonlydistinctnumbersfromtheoriginallist.Forexample,
Given
slurm
·
2016-02-02 22:00
LeetCode24. Swap Nodes in Pairs简单到一次性通过
Givenalinkedlist,swapeverytwoadjacentnodesandreturnitshead.Forexample,
Given
1->2->3->4,youshouldreturnthelistas
booirror
·
2016-02-02 21:00
LeetCode
链表
面试题
LeetCode300. Longest Increasing Subsequence
Given
[10,9,2,5,3,7,101,18],Thelongestincreasingsubsequenceis[2,3,7,101],thereforethelengthis4.思路：方法1：
codeTZ
·
2016-02-02 12:00
LeetCode
动态规划
LeetCode 258. Add Digits
Givenanon-negativeinteger num,repeatedlyaddallitsdigitsuntiltheresulthasonlyonedigit.Forexample:
Given
Appletable
·
2016-02-01 22:00
HDU 5618 Jam's problem again
ProblemDescriptionJamliketosolvetheproblemwhichonthe3D-axis,
given
N(1≤N≤100000) points (x,y,z)(1≤x,y,
jtjy568805874
·
2016-02-01 22:00
HDU
cdq分治
三维偏序
[LeetCode] Read N Characters
Given
Read4 用Read4来读取N个字符
TheAPI:intread4(char*buf)reads4charactersatatimefromafile.Thereturnvalueistheactualnumberofcharactersread.Forexample,itreturns3ifthereisonly3charactersleftinthefile.Byusingtheread4API,implementthefun
Grandyang
·
2016-02-01 02:00
Rotate List
Givenalist,rotatethelisttotherightbykplaces,wherekisnon-negative.Forexample:
Given
1->2->3->4->5->NULLandk
KickCode
·
2016-02-01 01:40
java
链表
Group Anagrams 异位构词
Givenanarrayofstrings,groupanagramstogether.Forexample,
given
:["eat","tea","tan","ate","nat","bat"],Return
KickCode
·
2016-01-31 13:43
java
异构词
Search for a Range
findthestartingandendingpositionofagiventargetvalue.Youralgorithm'sruntimecomplexitymustbeintheorderofO(logn).Ifthetargetisnotfoundinthearray,return[-1,-1].Forexample,
Given
KickCode
·
2016-01-31 12:03
java
二分法
Kth Largest Element in an Array -- LeetCode
kthlargestelementinanunsortedarray.Notethatitisthekthlargestelementinthesortedorder,notthekthdistinctelement.Forexample,
Given
fenshen371
·
2016-01-31 07:00
Missing Number
Givenanarraycontaining n distinctnumberstakenfrom 0,1,2,...,n,findtheonethatismissingfromthearray.Forexample,
Given
brucehb
·
2016-01-30 22:00
Single Number III
inwhichexactlytwoelementsappearonlyonceandalltheotherelementsappearexactlytwice.Findthetwoelementsthatappearonlyonce.Forexample:
Given
brucehb
·
2016-01-30 21:00
First Missing Positive -- LeetCode
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,
Given
[1,2,0] return 3,and
fenshen371
·
2016-01-30 14:00
LeetCode 228 Summary Ranges（值域）（*）
Forexample,
given
[0,1,2,4,5,7],return["0->2","4->5","7"].分
NoMasp
·
2016-01-30 13:00
LeetCode
C++
vector
ranges
228
Trapping Rain Water (Bar Height) -- LeetCode
Given
n non-negativeintegersrepresentinganelevationmapwherethewidthofeachbaris1,computehowmuchwateritisabletotrapafterraining.Forexample
fenshen371
·
2016-01-30 05:00
LeetCode22. Generate Parentheses
Given
n pairsofparentheses,writeafunctiontogenerateallcombinationsofwell-formedparentheses.Forexample
booirror
·
2016-01-29 21:00
LeetCode
回溯法
【树】Flatten Binary Tree to Linked List（先序遍历）
题目：Givenabinarytree,flattenittoalinkedlistin-place.Forexample,
Given
1 /\ 25 /\\ 346 Theflattenedtreeshouldlooklike
很好玩
·
2016-01-29 18:00
上一页
49
50
51
52
53
54
55
56
下一页
按字母分类：
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他