亞麻 2025 newgrad OA 分享

D 官網頭遞履歷
D + 3 收到ＯＡ
D + 7 完成ＯＡ
D + 8 收到獵頭通知通過ＯＡ，約VO
D + N 目前尚未等到確切VO時間
回歸正題
（一）第一題 (line sweeping)
```
There are m cities in a 1-dimensional country, where each city is represented by an integer between 1 through m. There are n Amazon warehouses, where the i^th warehouse can deliver to cities in the range cityStart[i] to cityEnd[i] for better delivery management.

For example, if there are m = 10 cities, and n = 2 warehouses cityStart = [3, 1] and cityEnd = [10, 5] then the first warehouse delivers to cities from 3 to 10 and the second one delivers from cities 1 to 5. Thus the cities 3, 4, and 5 are served by 2 warehouses and all others are served by exactly one.

Define F(x) as the number of warehouses that can deliver to the x^th city. The growth coefficient is F(1)^F(2)

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式

ns=[1 ,8, 6, 7, 7].
| Operation | x | y | locations |
| --- | --- | --- | --- |
| 1. | 1 | 5 | [8, 6, 7] |
| 2. | 1 | 3 | [6] |
| 3. | 1 | - | [ ] |
The manager needs to perform 3 operations to ship all of the products.
### Function Description
Complete the function minOperation in the editor below.
minOperation has the following parameter(s):
- int locations[n]: the location of each products.
### Returns
int: the minimum number of operations that the manager has to perform to ship all of the products.
### Constraints
- 1 ≤ n ≤ 10^5
- 1 ≤ locations[i] ≤ 10^9

收益良多，希望分享回饋，順便攢個米，感謝！