Third Maximum Number

    这道题为简单题

  题目:

    

 

  思路:

    我直接设置三个变量分别储存前三大值,遍历整个列表,然后就是与三个值分别比较,并且每次num += 1,如果最后num大于3,那么说明前三大值存在,返回f3,否则不存在返回f1

  代码: 

 1 class Solution(object):
 2     def thirdMax(self, nums):
 3         """
 4         :type nums: List[int]
 5         :rtype: int
 6         """
 7         f1 = float('-Inf')
 8         f2 = float('-Inf')
 9         f3 = float('-Inf')
10         num = 0
11         for i in nums:
12             if i > f1:
13                 f3 = f2
14                 f2 = f1
15                 f1 = i
16                 num += 1
17             elif f1 > i and i > f2:
18                 f3 = f2
19                 f2 = i
20                 num += 1
21             elif f2 > i and i > f3: 
22                 f3 = i
23                 num += 1
24         if num < 3: return f1
25         else: return f3

 

转载于:https://www.cnblogs.com/liuxinzhi/p/7571539.html

Yousef has an array a of size n . He wants to partition the array into one or more contiguous segments such that each element ai belongs to exactly one segment. A partition is called cool if, for every segment bj , all elements in bj also appear in bj+1 (if it exists). That is, every element in a segment must also be present in the segment following it. For example, if a=[1,2,2,3,1,5] , a cool partition Yousef can make is b1=[1,2] , b2=[2,3,1,5] . This is a cool partition because every element in b1 (which are 1 and 2 ) also appears in b2 . In contrast, b1=[1,2,2] , b2=[3,1,5] is not a cool partition, since 2 appears in b1 but not in b2 . Note that after partitioning the array, you do not change the order of the segments. Also, note that if an element appears several times in some segment bj , it only needs to appear at least once in bj+1 . Your task is to help Yousef by finding the maximum number of segments that make a cool partition. Input The first line of the input contains integer t (1≤t≤104 ) — the number of test cases. The first line of each test case contains an integer n (1≤n≤2⋅105 ) — the size of the array. The second line of each test case contains n integers a1,a2,…,an (1≤ai≤n ) — the elements of the array. It is guaranteed that the sum of n over all test cases doesn't exceed 2⋅105 . Output For each test case, print one integer — the maximum number of segments that make a cool partition. Example InputCopy 8 6 1 2 2 3 1 5 8 1 2 1 3 2 1 3 2 5 5 4 3 2 1 10 5 8 7 5 8 5 7 8 10 9 3 1 2 2 9 3 3 1 4 3 2 4 1 2 6 4 5 4 5 6 4 8 1 2 1 2 1 2 1 2 OutputCopy 2 3 1 3 1 3 3 4 Note The first test case is explained in the statement. We can partition it into b1=[1,2] , b2=[2,3,1,5] . It can be shown there is no other partition with more segments. In the second test case, we can partition the array into b1=[1,2] , b2=[1,3,2] , b3=[1,3,2] . The maximum number of segments is 3 . In the third test case, the only partition we can make is b1=[5,4,3,2,1]
最新发布
06-09
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值