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
leetcode之旅
LeetCode之旅
(17)-Ugly Number
题目:Writeaprogramtocheckwhetheragivennumberisanuglynumber. Uglynumbersarepositivenumberswhoseprimefactorsonlyinclude2,3,5.Forexample,6,8areuglywhile14isnotuglysinceitincludesanotherprimefactor7. Note
u010321471
·
2016-04-03 16:00
LeetCode
算法
面试
number
Ugly
LeetCode之旅
(16)-Climbing Stairs
题目描述:Youareclimbingastaircase.Ittakesnstepstoreachtothetop.Eachtimeyoucaneitherclimb1or2steps.Inhowmanydistinctwayscanyouclimbtothetop?先验知识:斐波那契数列斐波那契数列(Fibonaccisequence),又称黄金分割数列、因数学家列昂纳多·斐波那契(Leona
u010321471
·
2016-03-31 12:00
LeetCode
算法
面试
Stairs
Climbing
LeetCode之旅
(15)-Odd Even Linked List
题目描述:Givenasinglylinkedlist,groupalloddnodestogetherfollowedbytheevennodes.Pleasenoteherewearetalkingaboutthenodenumberandnotthevalueinthenodes.#Youshouldtrytodoitinplace.TheprogramshouldruninO(1)spac
u010321471
·
2016-03-31 09:00
LeetCode
算法
面试
LinkedList
Odd-even
leetCode之旅
(14)-Number of 1 Bits
题目描述:Writeafunctionthattakesanunsignedintegerandreturnsthenumberof’1’bitsithas(alsoknownastheHammingweight).Forexample,the32-bitinteger’11’hasbinaryrepresentation00000000000000000000000000001011,sothe
u010321471
·
2016-03-30 19:00
LeetCode
算法
面试
number
of1Bit
LeetCode之旅
(13)-Valid Anagram
题目介绍:Giventwostringssandt,writeafunctiontodetermineiftisananagramofs.Forexample,s=“anagram”,t=“nagaram”,returntrue.s=“rat”,t=“car”,returnfalse.Note:Youmayassumethestringcontainsonlylowercasealphabets.
u010321471
·
2016-03-30 18:00
LeetCode
算法
面试
valid
Anagram
leetCode之旅
(12)-反转二叉树
背景描述Homebrew是OSX平台上的包管理工具。用其官网的话说就是:themissingpackagemanagerforOSX|OSX平台遗失的包管理器。相信在用Mac的程序员,差不多都知道Homebrew。Homebrew的开发者是MaxHowell。今天Max在推特发帖:Google:90%ofourengineersusethesoftwareyouwrote(Homebrew),bu
u010321471
·
2016-03-30 17:00
LeetCode
算法
面试
二叉树
反转二叉树
leetcode之旅
(11)-Integer to Roman
Subscribetoseewhichcompaniesaskedthisquestion ShowTags ShowSimilarProblems 准备知识看上篇博客
leetcode之旅
(10)-Roma
u010321471
·
2016-03-29 23:00
LeetCode
算法
intToRoman
leetcode之旅
(10)-Roman to Integer
题目描述:Givenaromannumeral,convertittoaninteger. Inputisguaranteedtobewithintherangefrom1to3999. Subscribetoseewhichcompaniesaskedthisquestion预备知识:记数方法基本字符IVXLCDM相应的阿拉伯数字表示为15105010050010001、相同的数字连写,所表
u010321471
·
2016-03-29 22:00
LeetCode
算法
面试
RomanToInt
leetcode之旅
(9)-Reverse Linked List
题目描述:Reverseasinglylinkedlist. clicktoshowmorehints. Hint: Alinkedlistcanbereversedeitheriterativelyorrecursively.Couldyouimplementboth? Subscribetoseewhichcompaniesaskedthisquestion分析:注意这个数据结构,这是一
u010321471
·
2016-03-29 21:00
LeetCode
算法
list
reverse
linked
leetcode之旅
(8)-Contains Duplicate
题目:Givenanarrayofintegers,findifthearraycontainsanyduplicates.Yourfunctionshouldreturntrueifanyvalueappearsatleasttwiceinthearray,anditshouldreturnfalseifeveryelementisdistinct. Subscribetoseewhichco
u010321471
·
2016-03-29 21:00
LeetCode
算法
面试
Contains-D
leetcode之旅
(7)-Move Zeroes
MoveZeroes题目描述:Givenanarraynums,writeafunctiontomoveall0'stotheendofitwhilemaintainingtherelativeorderofthenon-zeroelements. Forexample,givennums=[0,1,0,3,12],aftercallingyourfunction,numsshouldbe[1,
u010321471
·
2016-03-29 20:00
LeetCode
算法
面试
Move-Zeroe
leetcode之旅
(6)-Add Digits
题目:Givenanon-negativeintegernum,repeatedlyaddallitsdigitsuntiltheresulthasonlyonedigit. Forexample: Givennum=38,theprocessislike:3+8=11,1+1=2.Since2hasonlyonedigit,returnit. Followup: Couldyoudoitw
u010321471
·
2016-03-29 17:00
LeetCode
算法
面试
Add-Digits
leetCode之旅
(5)-博弈论中极为经典的尼姆游戏
题目介绍YouareplayingthefollowingNimGamewithyourfriend:Thereisaheapofstonesonthetable,eachtimeoneofyoutaketurnstoremove1to3stones.Theonewhoremovesthelaststonewillbethewinner.Youwilltakethefirstturntoremov
u010321471
·
2016-03-29 17:00
LeetCode
博弈论
尼姆游戏
上一页
1
2
3
下一页
按字母分类:
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
其他