Add C# solutions

hellomrsun · hellomrsun · commit 58ca119a1786 · 2020-10-05T08:57:40.000+02:00
diff --git a/October-LeetCoding-Challenge/04-Remove-Covered-Intervals/Remove-Covered-Intervals.cs b/October-LeetCoding-Challenge/04-Remove-Covered-Intervals/Remove-Covered-Intervals.cs
@@ -0,0 +1,14 @@
+public class Solution {
+    public int RemoveCoveredIntervals(int[][] intervals) {
+        Array.Sort(intervals, (x, y) => x[0]==y[0] ? y[1]-x[1] : x[0]-y[0]);
+        int count = 0;
+        int curr = 0;
+        foreach(int[] interval in intervals){
+            if(curr < interval[1]){
+                curr = interval[1];
+                count++;
+            }
+        }
+        return count;
+    }
+}
diff --git a/README.md b/README.md
@@ -9,7 +9,7 @@ Click [here](https://leetcode.com/explore/challenge/card/october-leetcoding-chal
 Solutions in various programming languages are provided. Enjoy it.
 
 1. [Number of Recent Calls](https://github.com/AlgoStudyGroup/Leetcode/tree/master/October-LeetCoding-Challenge/01-Number-of-Recent-Calls) : Queue
-
+4. [Remove Covered Intervals](https://github.com/AlgoStudyGroup/Leetcode/tree/master/October-LeetCoding-Challenge/04-Remove-Covered-Intervals)
 
 ## September LeetCoding Challenge
 Click [here](https://leetcode.com/explore/challenge/card/september-leetcoding-challenge) for problem descriptions.
