上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 22 下一页
摘要: Single Number IIIGiven an array of numbersnums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find t... 阅读全文
posted @ 2015-08-28 00:27 `Liok 阅读(373) 评论(0) 推荐(0) 编辑
摘要: Longest Substring Without Repeating Characters Longest Substring Without Repeating Characters Given a string, find the length of the longest substring 阅读全文
posted @ 2015-08-26 18:21 `Liok 阅读(388) 评论(0) 推荐(0) 编辑
摘要: Missing NumberGiven an array containingndistinct numbers taken from0, 1, 2, ..., n, find the one that is missing from the array.For example,Givennums=... 阅读全文
posted @ 2015-08-24 10:27 `Liok 阅读(383) 评论(0) 推荐(0) 编辑
摘要: Course Schedule IIThere are a total ofncourses you have to take, labeled from0ton - 1.Some courses may have prerequisites, for example to take course ... 阅读全文
posted @ 2015-08-23 16:32 `Liok 阅读(409) 评论(0) 推荐(0) 编辑
摘要: Course ScheduleThere are a total ofncourses you have to take, labeled from0ton - 1.Some courses may have prerequisites, for example to take course 0 y... 阅读全文
posted @ 2015-08-23 16:25 `Liok 阅读(699) 评论(0) 推荐(0) 编辑
摘要: Ugly Number IIWrite a program to find then-th ugly number.Ugly numbers are positive numbers whose prime factors only include2, 3, 5. For example,1, 2,... 阅读全文
posted @ 2015-08-22 21:28 `Liok 阅读(529) 评论(0) 推荐(0) 编辑
摘要: Ugly NumberWrite a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include2, 3, 5... 阅读全文
posted @ 2015-08-22 19:19 `Liok 阅读(462) 评论(0) 推荐(0) 编辑
摘要: Single Number IIGiven an array of integers, every element appearsthreetimes except for one. Find that single one.Note:Your algorithm should have a lin... 阅读全文
posted @ 2015-08-18 22:50 `Liok 阅读(304) 评论(0) 推荐(0) 编辑
摘要: Single NumberGiven an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runti... 阅读全文
posted @ 2015-08-17 23:36 `Liok 阅读(606) 评论(0) 推荐(0) 编辑
摘要: Binary Tree PathsGiven a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-lea... 阅读全文
posted @ 2015-08-17 00:24 `Liok 阅读(773) 评论(0) 推荐(0) 编辑
上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 22 下一页