当前位置:网站首页>LeetCode 1560. The sector with the most passes on the circular track
LeetCode 1560. The sector with the most passes on the circular track
2022-07-06 16:42:00 【Daylight629】
1560. The most frequent sector on a circular track
Give you an integer n
And an array of integers rounds
. There is a circular track made up of n
Sectors make up , Sector number from 1
To n
. Now a marathon will be held on this track , The marathon is run by m
There are three stages . among , The first i
The next stage will be from sector rounds[i - 1]
Start , To sector rounds[i]
end . for instance , The first 1
Stage from rounds[0]
Start , To rounds[1]
end .
Please return the sectors that have passed the most times in the form of array , By sector number Ascending array .
Be careful , The track forms a circle counterclockwise in ascending order of sector number ( See the first example ).
Example 1:
Input :n = 4, rounds = [1,3,1,2]
Output :[1,2]
explain : This marathon starts from 1 Start . The order of passing through each sector is as follows :
1 --> 2 --> 3( Stage 1 end )--> 4 --> 1( Stage 2 end )--> 2( Stage 3 end , That is, the end of the Marathon )
among , A sector 1 and 2 Twice , They are the two sectors that have passed the most times . A sector 3 and 4 Only once .
Example 2:
Input :n = 2, rounds = [2,1,2,1,2,1,2,1,2]
Output :[2]
Example 3:
Input :n = 7, rounds = [1,3,5,7]
Output :[1,2,3,4,5,6,7]
Tips :
2 <= n <= 100
1 <= m <= 100
rounds.length == m + 1
1 <= rounds[i] <= n
rounds[i] != rounds[i + 1]
, among0 <= i < m
Two 、 Method 1
simulation
class Solution {
public List<Integer> mostVisited(int n, int[] rounds) {
List<Integer> res = new ArrayList<>();
int start = rounds[0];
int end = rounds[rounds.length - 1];
if (start <= end) {
for (int i = start; i <= end; i++) {
res.add(i);
}
} else {
for (int i = 1; i <= end; i++) {
res.add(i);
}
for (int i = start; i <= n; i++) {
res.add(i);
}
}
return res;
}
}
Complexity analysis
Time complexity :O(N). Maximum distance between start point and end point N-1 Sectors .
Spatial complexity :O(1). In addition to the answer array , We only need constant space to store several variables .
边栏推荐
- Spark的RDD(弹性分布式数据集)返回大结果集
- input 只能输入数字,限定输入
- (POJ - 1458) common subsequence (longest common subsequence)
- 顺丰科技智慧物流校园技术挑战赛(无t4)
- Bidirectional linked list - all operations
- Specify the format time, and fill in zero before the month and days
- Market trend report, technological innovation and market forecast of desktop electric tools in China
- Market trend report, technical innovation and market forecast of China's desktop capacitance meter
- 第三章 MapReduce框架原理
- Chapter 2 shell operation of hfds
猜你喜欢
随机推荐
Installation and configuration of MariaDB
Research Report on market supply and demand and strategy of China's tetraacetylethylenediamine (TAED) industry
(lightoj - 1323) billiard balls (thinking)
Advancedinstaller installation package custom action open file
Browser print margin, default / borderless, full 1 page A4
Codeforces Round #803 (Div. 2)A~C
(lightoj - 1236) pairs forming LCM (prime unique decomposition theorem)
Educational Codeforces Round 122 (Rated for Div. 2)
Market trend report, technical innovation and market forecast of double-sided foam tape in China
第5章 消费者组详解
Codeforces Global Round 19
Solve the problem of intel12 generation core CPU [small core full, large core onlookers] (win11)
浏览器打印边距,默认/无边距,占满1页A4
Problem - 1646C. Factorials and Powers of Two - Codeforces
(lightoj - 1370) Bi shoe and phi shoe (Euler function tabulation)
Spark independent cluster dynamic online and offline worker node
300th weekly match - leetcode
Classic application of stack -- bracket matching problem
Codeforces round 797 (Div. 3) no f
Acwing - game 55 of the week