Lunski's Clutter

Given an integer n and an integer array rounds. We have a circular track which consists of n sectors labeled from 1 to n. A marathon will be held on this track, the marathon consists of m rounds. The ith round starts at sector rounds[i - 1] and ends at sector rounds[i]. For example, round 1 starts at sector rounds[0] and ends at sector rounds[1]

Return an array of the most visited sectors sorted in ascending order.

Notice that you circulate the track in ascending order of sector numbers in the counter-clockwise direction (See the first example).

Example 1:

1
2
3
4
5

Input: n = 4, rounds = [1,3,1,2]
Output: [1,2]
Explanation: The marathon starts at sector 1. The order of the visited sectors is as follows:
1 --> 2 --> 3 (end of round 1) --> 4 --> 1 (end of round 2) --> 2 (end of round 3 and the marathon)
We can see that both sectors 1 and 2 are visited twice and they are the most visited sectors. Sectors 3 and 4 are visited only once.

Example 2:

1
2

Input: n = 2, rounds = [2,1,2,1,2,1,2,1,2]
Output: [2]

Example 3:

1
2

Input: n = 7, rounds = [1,3,5,7]
Output: [1,2,3,4,5,6,7]

GTD探討怎麼做(How)，但過程中會牽扯到很多人，尤其是我們的上司，DISA是(Who)。

Getting Things Done(GTD)在使用OKR確認好需要做什麼(What)之後，探討怎麼做(How)

Objectives and Key Results(OKR)是Google績效考核的一環，我們熟知的Key Performance Indicator(KPI)是上對下，OKR主張讓員工自動自發，這篇文章主要在介紹各種績效標準，這也是我回公司讀的第一本書。

Given an integer n. No-Zero integer is a positive integer which doesn’t contain any 0 in its decimal representation.

Return a list of two integers [A, B] where:

A and B are No-Zero integers.
A + B = n
It’s guarateed that there is at least one valid solution. If there are many valid solutions you can return any of them.

Example 1:

1
2
3

Input: n = 2
Output: [1,1]
Explanation: A = 1, B = 1. A + B = n and both A and B don't contain any 0 in their decimal representation.

Example 2:

1
2

Input: n = 11
Output: [2,9]

Example 3:

1
2

Input: n = 10000
Output: [1,9999]

Example 4:

1
2

Input: n = 69
Output: [1,68]

Example 5:

1
2

Input: n = 1010
Output: [11,999]