剑指offer
LUCASYAN个
这个作者很懒,什么都没留下…
展开
-
264. Ugly Number II 剑指offer
Write a program to find the n-th ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first原创 2017-09-13 14:05:21 · 176 阅读 · 0 评论 -
295. Find Median from Data Stream 剑指offer 数据流中的中位数
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Example 1: nums1 = [1,原创 2017-09-05 00:09:25 · 176 阅读 · 0 评论