数组
文章平均质量分 63
CloudShadow_
这个作者很懒,什么都没留下…
展开
-
[LeetCode]414. Third Maximum Number第三大的数
Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n). 给一个非空的整形数组,返回这个数组中第三大的数。如果它原创 2016-12-06 15:12:21 · 473 阅读 · 0 评论 -
[leetcode]263. Ugly Number丑数
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. For example, 6, 8 are ugly while 14 is not ugly si原创 2016-12-08 11:10:28 · 300 阅读 · 0 评论 -
[leetcode]217. Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is原创 2016-12-08 15:16:26 · 300 阅读 · 0 评论