feat: add solution to lc problem: No.0033 (#4062)

Author: djvelimir

solution/0000-0099/0033.Search in Rotated Sorted Array/README.md

@@ -281,6 +281,34 @@ var search = function (nums, target) {
 };
 ```
 
+#### C#
+
+```cs
+public class Solution {
+    public int Search(int[] nums, int target) {
+        int n = nums.Length;
+        int left = 0, right = n - 1;
+        while (left < right) {
+            int mid = (left + right) >> 1;
+            if (nums[0] <= nums[mid]) {
+                if (nums[0] <= target && target <= nums[mid]) {
+                    right = mid;
+                } else {
+                    left = mid + 1;
+                }
+            } else {
+                if (nums[mid] < target && target <= nums[n - 1]) {
+                    left = mid + 1;
+                } else {
+                    right = mid;
+                }
+            }
+        }
+        return nums[left] == target ? left : -1;
+    }
+}
+```
+
 #### PHP
 
 ```php

solution/0000-0099/0033.Search in Rotated Sorted Array/README_EN.md

@@ -269,6 +269,34 @@ var search = function (nums, target) {
 };
 ```
 
+#### C#
+
+```cs
+public class Solution {
+    public int Search(int[] nums, int target) {
+        int n = nums.Length;
+        int left = 0, right = n - 1;
+        while (left < right) {
+            int mid = (left + right) >> 1;
+            if (nums[0] <= nums[mid]) {
+                if (nums[0] <= target && target <= nums[mid]) {
+                    right = mid;
+                } else {
+                    left = mid + 1;
+                }
+            } else {
+                if (nums[mid] < target && target <= nums[n - 1]) {
+                    left = mid + 1;
+                } else {
+                    right = mid;
+                }
+            }
+        }
+        return nums[left] == target ? left : -1;
+    }
+}
+```
+
 #### PHP
 
 ```php

solution/0000-0099/0033.Search in Rotated Sorted Array/Solution.cs

@@ -0,0 +1,23 @@
+public class Solution {
+    public int Search(int[] nums, int target) {
+        int n = nums.Length;
+        int left = 0, right = n - 1;
+        while (left < right) {
+            int mid = (left + right) >> 1;
+            if (nums[0] <= nums[mid]) {
+                if (nums[0] <= target && target <= nums[mid]) {
+                    right = mid;
+                } else {
+                    left = mid + 1;
+                }
+            } else {
+                if (nums[mid] < target && target <= nums[n - 1]) {
+                    left = mid + 1;
+                } else {
+                    right = mid;
+                }
+            }
+        }
+        return nums[left] == target ? left : -1;
+    }
+}