fix(csharp): Modify method name to PascalCase, simplify new expression (#840)

* Modify method name to PascalCase(array and linked list)

* Modify method name to PascalCase(backtracking)

* Modify method name to PascalCase(computational complexity)

* Modify method name to PascalCase(divide and conquer)

* Modify method name to PascalCase(dynamic programming)

* Modify method name to PascalCase(graph)

* Modify method name to PascalCase(greedy)

* Modify method name to PascalCase(hashing)

* Modify method name to PascalCase(heap)

* Modify method name to PascalCase(searching)

* Modify method name to PascalCase(sorting)

* Modify method name to PascalCase(stack and queue)

* Modify method name to PascalCase(tree)

* local check

codes/csharp/chapter_stack_and_queue/array_queue.cs

@@ -8,7 +8,7 @@ namespace hello_algo.chapter_stack_and_queue;
 
 /* 基于环形数组实现的队列 */
 class ArrayQueue {
-    private int[] nums;  // 用于存储队列元素的数组
+    private readonly int[] nums;  // 用于存储队列元素的数组
     private int front;   // 队首指针，指向队首元素
     private int queSize; // 队列长度
 
@@ -18,56 +18,56 @@ class ArrayQueue {
     }
 
     /* 获取队列的容量 */
-    public int capacity() {
+    public int Capacity() {
         return nums.Length;
     }
 
     /* 获取队列的长度 */
-    public int size() {
+    public int Size() {
         return queSize;
     }
 
     /* 判断队列是否为空 */
-    public bool isEmpty() {
+    public bool IsEmpty() {
         return queSize == 0;
     }
 
     /* 入队 */
-    public void push(int num) {
-        if (queSize == capacity()) {
+    public void Push(int num) {
+        if (queSize == Capacity()) {
             Console.WriteLine("队列已满");
             return;
         }
         // 计算尾指针，指向队尾索引 + 1
         // 通过取余操作，实现 rear 越过数组尾部后回到头部
-        int rear = (front + queSize) % capacity();
+        int rear = (front + queSize) % Capacity();
         // 将 num 添加至队尾
         nums[rear] = num;
         queSize++;
     }
 
     /* 出队 */
-    public int pop() {
-        int num = peek();
+    public int Pop() {
+        int num = Peek();
         // 队首指针向后移动一位，若越过尾部则返回到数组头部
-        front = (front + 1) % capacity();
+        front = (front + 1) % Capacity();
         queSize--;
         return num;
     }
 
     /* 访问队首元素 */
-    public int peek() {
-        if (isEmpty())
+    public int Peek() {
+        if (IsEmpty())
             throw new Exception();
         return nums[front];
     }
 
     /* 返回数组 */
-    public int[] toArray() {
+    public int[] ToArray() {
         // 仅转换有效长度范围内的列表元素
         int[] res = new int[queSize];
         for (int i = 0, j = front; i < queSize; i++, j++) {
-            res[i] = nums[j % this.capacity()];
+            res[i] = nums[j % this.Capacity()];
         }
         return res;
     }
@@ -78,37 +78,37 @@ public class array_queue {
     public void Test() {
         /* 初始化队列 */
         int capacity = 10;
-        ArrayQueue queue = new ArrayQueue(capacity);
+        ArrayQueue queue = new(capacity);
 
         /* 元素入队 */
-        queue.push(1);
-        queue.push(3);
-        queue.push(2);
-        queue.push(5);
-        queue.push(4);
-        Console.WriteLine("队列 queue = " + string.Join(",", queue.toArray()));
+        queue.Push(1);
+        queue.Push(3);
+        queue.Push(2);
+        queue.Push(5);
+        queue.Push(4);
+        Console.WriteLine("队列 queue = " + string.Join(",", queue.ToArray()));
 
         /* 访问队首元素 */
-        int peek = queue.peek();
+        int peek = queue.Peek();
         Console.WriteLine("队首元素 peek = " + peek);
 
         /* 元素出队 */
-        int pop = queue.pop();
-        Console.WriteLine("出队元素 pop = " + pop + "，出队后 queue = " + string.Join(",", queue.toArray()));
+        int pop = queue.Pop();
+        Console.WriteLine("出队元素 pop = " + pop + "，出队后 queue = " + string.Join(",", queue.ToArray()));
 
         /* 获取队列的长度 */
-        int size = queue.size();
+        int size = queue.Size();
         Console.WriteLine("队列长度 size = " + size);
 
         /* 判断队列是否为空 */
-        bool isEmpty = queue.isEmpty();
+        bool isEmpty = queue.IsEmpty();
         Console.WriteLine("队列是否为空 = " + isEmpty);
 
         /* 测试环形数组 */
         for (int i = 0; i < 10; i++) {
-            queue.push(i);
-            queue.pop();
-            Console.WriteLine("第 " + i + " 轮入队 + 出队后 queue = " + string.Join(",", queue.toArray()));
+            queue.Push(i);
+            queue.Pop();
+            Console.WriteLine("第 " + i + " 轮入队 + 出队后 queue = " + string.Join(",", queue.ToArray()));
         }
     }
 }