docs: Updated solution URLs with URL encoded texts

Author: maxchui

0001-1000.md

@@ -8,6 +8,6 @@
 
 |  #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Tag          | Note|  
 |-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------|-----|
-|0001|[Two Sum](https://leetcode.com/problems/two-sum/)| [C#](./C#/1-Two_Sum.cs)| $O(n)$| $O(n)$|Easy|||  
-|0049|[Group Anagrams](https://leetcode.com/problems/group-anagrams/)| [C#](./C#/49-Group_Anagrams.cs)| $O(n \cdot  m \cdot log(m))$| $O(n \cdot m)$|Medium|||
-|0217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)| [C#](./C#/217-Contains_Duplicate.cs)| $O(n)$| $O(n)$|Easy|||
+|0001|[Two Sum](https://leetcode.com/problems/two-sum/)| [C#](./C%23/1-Two_Sum.cs)| $O(n)$| $O(n)$|Easy|||  
+|0049|[Group Anagrams](https://leetcode.com/problems/group-anagrams/)| [C#](./C%23/49-Group_Anagrams.cs)| $O(n \cdot  m \cdot log(m))$| $O(n \cdot m)$|Medium|||
+|0217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)| [C#](./C%23/217-Contains_Duplicate.cs)| $O(n)$| $O(n)$|Easy|||