1 2 3 4 5 ··· 22 下一页
摘要: Intersection of Two Arrays II Intersection of Two Arrays II Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1 阅读全文
posted @ 2016-05-22 21:27 `Liok 阅读(899) 评论(0) 推荐(0) 编辑
摘要: Intersection of Two Arrays Intersection of Two Arrays Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2 阅读全文
posted @ 2016-05-19 19:53 `Liok 阅读(523) 评论(0) 推荐(0) 编辑
摘要: Integer Break Integer Break Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those inte 阅读全文
posted @ 2016-05-13 17:59 `Liok 阅读(426) 评论(0) 推荐(0) 编辑
摘要: Reverse String Reverse String Write a function that takes a string as input and returns the string reversed. Example:Given s = "hello", return "olleh" 阅读全文
posted @ 2016-05-13 17:16 `Liok 阅读(272) 评论(0) 推荐(0) 编辑
摘要: op K Frequent Elements op K Frequent Elements Given a non-empty array of integers, return the k most frequent elements. For example,Given [1,1,1,2,2,3 阅读全文
posted @ 2016-05-13 16:34 `Liok 阅读(711) 评论(0) 推荐(0) 编辑
摘要: Flatten Nested List Iterator Flatten Nested List Iterator Given a nested list of integers, implement an iterator to flatten it. Each element is either 阅读全文
posted @ 2016-05-13 16:23 `Liok 阅读(1340) 评论(0) 推荐(0) 编辑
摘要: Reverse Vowels of a String Reverse Vowels of a String Write a function that takes a string as input and reverse only the vowels of a string. Example 1 阅读全文
posted @ 2016-05-13 16:18 `Liok 阅读(1045) 评论(0) 推荐(0) 编辑
摘要: Power of Four Power of Four Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example:Given num = 16, return tr 阅读全文
posted @ 2016-04-19 14:01 `Liok 阅读(379) 评论(0) 推荐(0) 编辑
摘要: Maximum Subarray Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example 阅读全文
posted @ 2016-03-27 22:28 `Liok 阅读(726) 评论(0) 推荐(0) 编辑
摘要: House Robber III House Robber III The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the 阅读全文
posted @ 2016-03-19 22:56 `Liok 阅读(454) 评论(0) 推荐(0) 编辑
1 2 3 4 5 ··· 22 下一页