-
Notifications
You must be signed in to change notification settings - Fork 27
/
Copy pathRemoveDuplicatesfromSortedArray.cs
52 lines (44 loc) · 1.46 KB
/
RemoveDuplicatesfromSortedArray.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/* ==============================================================================
* 功能描述:ThirdMaximumNumber
* 创 建 者:gz
* 创建日期:2017/4/21 8:25:57
* ==============================================================================*/
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
//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).
//Example 1:
//Input: [3, 2, 1]
//Output: 1
//Explanation: The third maximum is 1.
//Example 2:
//Input: [1, 2]
//Output: 2
//Explanation: The third maximum does not exist, so the maximum (2) is returned instead.
//Example 3:
//Input: [2, 2, 3, 1]
//Output: 1
//Explanation: Note that the third maximum here means the third maximum distinct number.
//Both numbers with value 2 are both considered as second maximum.
namespace Array.Lib
{
/// <summary>
/// #414 : Third Maximum Number
/// </summary>
public class ThirdMaximumNumber
{
public int GetThirdMax(int[] a)
{
int first = a.Max();
int[] a2 = a.Where(r => r != first).ToArray();
if (a2.Length == 0)
return first;
int second = a2.Max();
int[] a3 = a2.Where(r => r != second).ToArray();
if (a3.Length == 0)
return first;
return a3.Max();
}
}
}