[C#] Consider only start and end sectors
Inspired by @hobiter\'s answer: https://leetcode.com/problems/most-visited-sector-in-a-circular-track/discuss/806715/Java-check-first-and-last\n\nOne key detail
Inspired by @hobiter\'s answer: https://leetcode.com/problems/most-visited-sector-in-a-circular-track/discuss/806715/Java-check-first-and-last\n\nOne key detail of this problem is that because the rounds do not skip any sectors on the track, we only need to consider the difference between the start and end sector. `Enumerable.Range` helps keep the answer succint.\n\nIf the start sector is less than or equal to the end sector, return the range of values between them (inclusive). Else, return the range of values from sector 1 through to the end concatenated with the range from the start through n.\n\n```\npublic class Solution \n{\n    public IList<int> MostVisited(int n, int[] rounds) \n\t{\n        var start = rounds[0];\n        var end = rounds[rounds.Length - 1];\n        if (start <= end)\n        {\n            // return the subset of the track we started and ended on:\n            return Enumerable.Range(start, end - start + 1).ToList();\n        }\n        else\n        {\n            // to respect returning the result in ascending order, use the following:\n            // [...1 through the end, ...start through n]\n            return Enumerable.Range(1, end).Concat(Enumerable.Range(start, n - start + 1)).ToList();\n        }\n    }\n}\n```
[]