feat: add solutions to lc problem: No.1561

No.1561.Maximum Number of Coins You Can Get

Author: YangFong

solution/1500-1599/1561.Maximum Number of Coins You Can Get/README.md

@@ -120,6 +120,53 @@ func maxCoins(piles []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxCoins(piles: number[]): number {
+    piles.sort((a, b) => a - b);
+    const n = piles.length;
+    let ans = 0;
+    for (let i = 1; i <= Math.floor(n / 3); i++) {
+        ans += piles[n - 2 * i];
+    }
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn max_coins(mut piles: Vec<i32>) -> i32 {
+        piles.sort();
+        let n = piles.len();
+        let mut ans = 0;
+        for i in 1..=n / 3 {
+            ans += piles[n - 2 * i];
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int cmp(const void *a, const void *b) {
+    return *(int *) a - *(int *) b;
+}
+
+int maxCoins(int *piles, int pilesSize) {
+    qsort(piles, pilesSize, sizeof(int), cmp);
+    int ans = 0;
+    for (int i = 1; i <= pilesSize / 3; i++) {
+        ans += piles[pilesSize - 2 * i];
+    };
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1500-1599/1561.Maximum Number of Coins You Can Get/README_EN.md

@@ -110,6 +110,53 @@ func maxCoins(piles []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxCoins(piles: number[]): number {
+    piles.sort((a, b) => a - b);
+    const n = piles.length;
+    let ans = 0;
+    for (let i = 1; i <= Math.floor(n / 3); i++) {
+        ans += piles[n - 2 * i];
+    }
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn max_coins(mut piles: Vec<i32>) -> i32 {
+        piles.sort();
+        let n = piles.len();
+        let mut ans = 0;
+        for i in 1..=n / 3 {
+            ans += piles[n - 2 * i];
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int cmp(const void *a, const void *b) {
+    return *(int *) a - *(int *) b;
+}
+
+int maxCoins(int *piles, int pilesSize) {
+    qsort(piles, pilesSize, sizeof(int), cmp);
+    int ans = 0;
+    for (int i = 1; i <= pilesSize / 3; i++) {
+        ans += piles[pilesSize - 2 * i];
+    };
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1500-1599/1561.Maximum Number of Coins You Can Get/Solution.c

@@ -0,0 +1,12 @@
+int cmp(const void *a, const void *b) {
+    return *(int *) a - *(int *) b;
+}
+
+int maxCoins(int *piles, int pilesSize) {
+    qsort(piles, pilesSize, sizeof(int), cmp);
+    int ans = 0;
+    for (int i = 1; i <= pilesSize / 3; i++) {
+        ans += piles[pilesSize - 2 * i];
+    };
+    return ans;
+}

solution/1500-1599/1561.Maximum Number of Coins You Can Get/Solution.rs

@@ -0,0 +1,11 @@
+impl Solution {
+    pub fn max_coins(mut piles: Vec<i32>) -> i32 {
+        piles.sort();
+        let n = piles.len();
+        let mut ans = 0;
+        for i in 1..=n / 3 {
+            ans += piles[n - 2 * i];
+        }
+        ans
+    }
+}

solution/1500-1599/1561.Maximum Number of Coins You Can Get/Solution.ts

@@ -0,0 +1,9 @@
+function maxCoins(piles: number[]): number {
+    piles.sort((a, b) => a - b);
+    const n = piles.length;
+    let ans = 0;
+    for (let i = 1; i <= Math.floor(n / 3); i++) {
+        ans += piles[n - 2 * i];
+    }
+    return ans;
+}