|
67 | 67 |
|
68 | 68 | <!-- 这里可写通用的实现逻辑 -->
|
69 | 69 |
|
| 70 | +**方法一:O(n) 遍历** |
| 71 | + |
| 72 | +经过验证,若暴力遍历,调用 $O(n^2)$ 次 $knows$ 方法,会报 TLE 错误。因此,我们需要寻找更优的解法。 |
| 73 | + |
| 74 | +要找出 $n$ 个人中的名人,题目给我们的关键信息是:1. 名人不认识其他所有人;2. 其他所有人都认识名人。 |
| 75 | + |
| 76 | +那么,我们初始时假定名人 $ans=0$。然后在 $[1,n)$ 范围内遍历 $i$,若 $ans$ 认识 $i$,说明 $ans$ 不是我们要找的名人,此时我们可以直接将 $ans$ 更新为 $i$。 |
| 77 | + |
| 78 | +为什么呢?我们来举个实际的例子。 |
| 79 | + |
| 80 | +```bash |
| 81 | +ans = 0 |
| 82 | +for i in [1,n) { |
| 83 | + if (ans knows i) { |
| 84 | + ans = i |
| 85 | + } |
| 86 | +} |
| 87 | + |
| 88 | +ans = 0 |
| 89 | + |
| 90 | +ans not knows 1 |
| 91 | +ans not knows 2 |
| 92 | +ans knows 3 |
| 93 | +ans = 3 |
| 94 | + |
| 95 | +ans not knows 4 |
| 96 | +ans not knows 5 |
| 97 | +ans not knows 6 |
| 98 | +ans = 6 |
| 99 | +``` |
| 100 | +
|
| 101 | +$ans$ 认识 $3$,说明 $ans$ 不是名人($0$ 不是名人),那么名人会是 $1$ 或者 $2$ 吗?不会!因为若 $1$ 或者 $2$ 是名人,那么 $0$ 应该认识 $1$ 或者 $2$ 才对,与前面的例子冲突。因此,我们可以直接将 $ans$ 更新为 $i$。 |
| 102 | +
|
| 103 | +我们找出 $ans$ 之后,接下来再遍历一遍,判断 $ans$ 是否满足名人的条件。若不满足,返回 $-1$。 |
| 104 | +
|
| 105 | +否则遍历结束,返回 $ans$。 |
| 106 | +
|
70 | 107 | <!-- tabs:start -->
|
71 | 108 |
|
72 | 109 | ### **Python3**
|
73 | 110 |
|
74 | 111 | <!-- 这里可写当前语言的特殊实现逻辑 -->
|
75 | 112 |
|
76 | 113 | ```python
|
77 |
| - |
| 114 | +# The knows API is already defined for you. |
| 115 | +# return a bool, whether a knows b |
| 116 | +# def knows(a: int, b: int) -> bool: |
| 117 | + |
| 118 | +class Solution: |
| 119 | + def findCelebrity(self, n: int) -> int: |
| 120 | + ans = 0 |
| 121 | + for i in range(1, n): |
| 122 | + if knows(ans, i): |
| 123 | + ans = i |
| 124 | + for i in range(n): |
| 125 | + if ans != i: |
| 126 | + if knows(ans, i) or not knows(i, ans): |
| 127 | + return -1 |
| 128 | + return ans |
78 | 129 | ```
|
79 | 130 |
|
80 | 131 | ### **Java**
|
81 | 132 |
|
82 | 133 | <!-- 这里可写当前语言的特殊实现逻辑 -->
|
83 | 134 |
|
84 | 135 | ```java
|
| 136 | +/* The knows API is defined in the parent class Relation. |
| 137 | + boolean knows(int a, int b); */ |
| 138 | + |
| 139 | +public class Solution extends Relation { |
| 140 | + public int findCelebrity(int n) { |
| 141 | + int ans = 0; |
| 142 | + for (int i = 1; i < n; ++i) { |
| 143 | + if (knows(ans, i)) { |
| 144 | + ans = i; |
| 145 | + } |
| 146 | + } |
| 147 | + for (int i = 0; i < n; ++i) { |
| 148 | + if (ans != i) { |
| 149 | + if (knows(ans, i) || !knows(i, ans)) { |
| 150 | + return -1; |
| 151 | + } |
| 152 | + } |
| 153 | + } |
| 154 | + return ans; |
| 155 | + } |
| 156 | +} |
| 157 | +``` |
| 158 | +
|
| 159 | +### **C++** |
| 160 | +
|
| 161 | +```cpp |
| 162 | +/* The knows API is defined for you. |
| 163 | + bool knows(int a, int b); */ |
| 164 | + |
| 165 | +class Solution { |
| 166 | +public: |
| 167 | + int findCelebrity(int n) { |
| 168 | + int ans = 0; |
| 169 | + for (int i = 1; i < n; ++i) { |
| 170 | + if (knows(ans, i)) { |
| 171 | + ans = i; |
| 172 | + } |
| 173 | + } |
| 174 | + for (int i = 0; i < n; ++i) { |
| 175 | + if (ans != i) { |
| 176 | + if (knows(ans, i) || !knows(i, ans)) { |
| 177 | + return -1; |
| 178 | + } |
| 179 | + } |
| 180 | + } |
| 181 | + return ans; |
| 182 | + } |
| 183 | +}; |
| 184 | +``` |
85 | 185 |
|
| 186 | +### **Go** |
| 187 | +
|
| 188 | +```go |
| 189 | +/** |
| 190 | + * The knows API is already defined for you. |
| 191 | + * knows := func(a int, b int) bool |
| 192 | + */ |
| 193 | +func solution(knows func(a int, b int) bool) func(n int) int { |
| 194 | + return func(n int) int { |
| 195 | + ans := 0 |
| 196 | + for i := 1; i < n; i++ { |
| 197 | + if knows(ans, i) { |
| 198 | + ans = i |
| 199 | + } |
| 200 | + } |
| 201 | + for i := 0; i < n; i++ { |
| 202 | + if ans != i { |
| 203 | + if knows(ans, i) || !knows(i, ans) { |
| 204 | + return -1 |
| 205 | + } |
| 206 | + } |
| 207 | + } |
| 208 | + return ans |
| 209 | + } |
| 210 | +} |
86 | 211 | ```
|
87 | 212 |
|
88 | 213 | ### **...**
|
|
0 commit comments