摘要:
Sort a linked list in O(n log n) time using constant space complexity. Example 1: Input: 4->2->1->3 Output: 1->2->3->4 Example 2: Input: -1->5->3->4-> 阅读全文
posted @ 2019-03-16 11:59
Schwifty
阅读(130)
评论(0)
推荐(0)
摘要:
Given a linked list, determine if it has a cycle in it. To represent a cycle in the given linked list, we use an integer pos which represents the posi 阅读全文
posted @ 2019-03-16 11:17
Schwifty
阅读(126)
评论(0)
推荐(0)
摘要:
Write a program to find the n-th ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. Example: Input: n = 10 Outpu 阅读全文
posted @ 2019-03-16 09:58
Schwifty
阅读(129)
评论(0)
推荐(0)
摘要:
Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. Example 阅读全文
posted @ 2019-03-16 08:52
Schwifty
阅读(117)
评论(0)
推荐(0)

浙公网安备 33010602011771号