`Liok - 博客园

2015年9月5日

[LeetCode][JavaScript]Container With Most Water

摘要： Container With Most WaterGivennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such t... 阅读全文

posted @ 2015-09-05 17:49 `Liok 阅读(314) 评论(0) 推荐(0) 编辑

[LeetCode][JavaScript]H-Index II

摘要： H-Index IIFollow upforH-Index: What if thecitationsarray is sorted in ascending order? Could you optimize your algorithm?Hint:Expected runtime complex... 阅读全文

posted @ 2015-09-05 01:28 `Liok 阅读(405) 评论(0) 推荐(0) 编辑

[LeetCode][JavaScript]H-Index

摘要： H-IndexGiven an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.Acc... 阅读全文

posted @ 2015-09-05 01:23 `Liok 阅读(575) 评论(0) 推荐(0) 编辑

2015年9月1日

[LeetCode][JavaScript]Integer to English Words

摘要： Integer to English WordsConvert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231- 1.For examp... 阅读全文

posted @ 2015-09-01 14:50 `Liok 阅读(573) 评论(0) 推荐(0) 编辑

2015年8月30日

[LeetCode][JavaScript]Linked List Cycle II

摘要： Linked List Cycle IIGiven a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Note:Do not modify the linked list.F... 阅读全文

posted @ 2015-08-30 21:17 `Liok 阅读(319) 评论(0) 推荐(0) 编辑

[LeetCode][JavaScript]Linked List Cycle

摘要： Linked List CycleGiven a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?https://leetcode.com/prob... 阅读全文

posted @ 2015-08-30 21:14 `Liok 阅读(404) 评论(0) 推荐(0) 编辑

[LeetCode][JavaScript]Integer to Roman

摘要： Integer to RomanGiven an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.https://leetcode.com/problem... 阅读全文

posted @ 2015-08-30 16:20 `Liok 阅读(405) 评论(0) 推荐(0) 编辑

[LeetCode][JavaScript]Roman to Integer

摘要： Roman to IntegerGiven a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.https://leetcode.com/problem... 阅读全文

posted @ 2015-08-30 00:40 `Liok 阅读(520) 评论(0) 推荐(0) 编辑

2015年8月29日

[LeetCode][JavaScript]Reverse Integer

摘要： Reverse IntegerReverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321click to show spoilers.Have you thought about th... 阅读全文

posted @ 2015-08-29 22:32 `Liok 阅读(606) 评论(0) 推荐(0) 编辑

[LeetCode][JavaScript]Longest Palindromic Substring

摘要： Longest Palindromic SubstringGiven a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there... 阅读全文

posted @ 2015-08-29 22:19 `Liok 阅读(561) 评论(0) 推荐(0) 编辑

Liok

公告