-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1608-SpecialArrayWithXElementsGreaterThanOrEqualX.go
More file actions
95 lines (83 loc) · 2.81 KB
/
1608-SpecialArrayWithXElementsGreaterThanOrEqualX.go
File metadata and controls
95 lines (83 loc) · 2.81 KB
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
package main
// 1608. Special Array With X Elements Greater Than or Equal X
// You are given an array nums of non-negative integers.
// nums is considered special if there exists a number x such that there are exactly x numbers in nums that are greater than or equal to x.
// Notice that x does not have to be an element in nums.
// Return x if the array is special, otherwise, return -1.
// It can be proven that if nums is special, the value for x is unique.
// Example 1:
// Input: nums = [3,5]
// Output: 2
// Explanation: There are 2 values (3 and 5) that are greater than or equal to 2.
// Example 2:
// Input: nums = [0,0]
// Output: -1
// Explanation: No numbers fit the criteria for x.
// If x = 0, there should be 0 numbers >= x, but there are 2.
// If x = 1, there should be 1 number >= x, but there are 0.
// If x = 2, there should be 2 numbers >= x, but there are 0.
// x cannot be greater since there are only 2 numbers in nums.
// Example 3:
// Input: nums = [0,4,3,0,4]
// Output: 3
// Explanation: There are 3 values that are greater than or equal to 3.
// Constraints:
// 1 <= nums.length <= 100
// 0 <= nums[i] <= 1000
import "fmt"
import "sort"
func specialArray(nums []int) int {
res, m := -1, map[int]int{};
for _, v := range nums { // 统计每个字符出现次数
m[v]++
}
for i := 1; i <= len(nums); i++ {
count := 0
for k, v := range m {
if k >= i {
count += v
}
}
if count == i { // 恰好有 x 个元素 大于或者等于 x
res = i
}
}
return res
}
func specialArray1(nums []int) int {
sort.Ints(nums)
n := len(nums)
if nums[0] >= n {
return n
}
for i := 1; i < n; i++ {
if n - i <= nums[i] && n - i > nums[i - 1]{
return n - i
}
}
return -1
}
func main() {
// Example 1:
// Input: nums = [3,5]
// Output: 2
// Explanation: There are 2 values (3 and 5) that are greater than or equal to 2.
fmt.Println(specialArray([]int{3,5})) // 2
// Example 2:
// Input: nums = [0,0]
// Output: -1
// Explanation: No numbers fit the criteria for x.
// If x = 0, there should be 0 numbers >= x, but there are 2.
// If x = 1, there should be 1 number >= x, but there are 0.
// If x = 2, there should be 2 numbers >= x, but there are 0.
// x cannot be greater since there are only 2 numbers in nums.
fmt.Println(specialArray([]int{0, 0})) // -1
// Example 3:
// Input: nums = [0,4,3,0,4]
// Output: 3
// Explanation: There are 3 values that are greater than or equal to 3.
fmt.Println(specialArray([]int{0,4,3,0,4})) // 3
fmt.Println(specialArray1([]int{3,5})) // 2
fmt.Println(specialArray1([]int{0, 0})) // -1
fmt.Println(specialArray1([]int{0,4,3,0,4})) // 3
}