Compare First And Last Visited Sectors
IntuitionThere are 3 cases should be considered:
start sector is smaller than end sector:return from start to end;
start sector is larger than end sector: retur
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->
There are 3 cases should be considered:
1. start sector is smaller than end sector:return from start to end;
2. start sector is larger than end sector: return from start to n, then from 1 to end(fill in 1~end firstly to avoid sort list);
3. start sector == end sector: return this sector;
# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```csharp []
public class Solution {
    public IList<int> MostVisited(int n, int[] rounds) {
       
        int len = rounds.Length;
        List<int> res = new();
        if(rounds[0] < rounds[len-1]) // case round[0] < round[last]:
        {
            for(int i = rounds[0]; i <= rounds[len-1]; i++)
            {
                res.Add(i);
            }
        }
        else if(rounds[0] > rounds[len-1]) // case rounds[0] > rounds[last]
        {
            for(int i = 1; i <= rounds[len-1]; i++)
            {
                res.Add(i);
            }

            // from 1 to rounds[len-1], then from rounds[0] to n
            for(int i = rounds[0]; i <= n; i++)
            {
                res.Add(i);
            }
        }
        else // single point is most visited
        {
            res.Add(rounds[0]);
        }

        return res;
    }
}
```
['C#']