feat: add csharp solution to lc problem: No.2389 (doocs#1895)

--------- Co-authored-by: Jahir509 <[email protected]> Co-authored-by: Libin YANG <[email protected]>
hiahiahia0213 · Oct 29, 2023 · fd17349 · fd17349
1 parent a27055d
commit fd17349
Show file tree

Hide file tree

Showing 3 changed files with 76 additions and 0 deletions.
diff --git a/solution/2300-2399/2389.Longest Subsequence With Limited Sum/README.md b/solution/2300-2399/2389.Longest Subsequence With Limited Sum/README.md
@@ -311,6 +311,33 @@ impl Solution {
 }
 ```
 
+### **C#**
+
+```cs
+public class Solution {
+    public int[] AnswerQueries(int[] nums, int[] queries) {
+        int[] result = new int[queries.Length];
+        Array.Sort(nums);
+        for (int i = 0; i < queries.Length; i++) {
+            result[i] = getSubsequent(nums, queries[i]);
+        }
+        return result;
+
+    }
+
+    public int getSubsequent(int[] nums,int query) {
+        int sum = 0;
+        for (int i = 0; i < nums.Length; i++) {
+            sum += nums[i];
+            if (sum > query) {
+                return i;
+            }
+        }
+        return nums.Length;
+    }
+}
+```
+
 ### **...**
 
 ```

diff --git a/solution/2300-2399/2389.Longest Subsequence With Limited Sum/README_EN.md b/solution/2300-2399/2389.Longest Subsequence With Limited Sum/README_EN.md
@@ -279,6 +279,33 @@ impl Solution {
 }
 ```
 
+### **C#**
+
+```cs
+public class Solution {
+    public int[] AnswerQueries(int[] nums, int[] queries) {
+        int[] result = new int[queries.Length];
+        Array.Sort(nums);
+        for (int i = 0; i < queries.Length; i++) {
+            result[i] = getSubsequent(nums, queries[i]);
+        }
+        return result;
+
+    }
+
+    public int getSubsequent(int[] nums,int query) {
+        int sum = 0;
+        for (int i = 0; i < nums.Length; i++) {
+            sum += nums[i];
+            if (sum > query) {
+                return i;
+            }
+        }
+        return nums.Length;
+    }
+}
+```
+
 ### **...**
 
 ```

diff --git a/solution/2300-2399/2389.Longest Subsequence With Limited Sum/solution.cs b/solution/2300-2399/2389.Longest Subsequence With Limited Sum/solution.cs
@@ -0,0 +1,22 @@
+public class Solution {
+    public int[] AnswerQueries(int[] nums, int[] queries) {
+        int[] result = new int[queries.Length];
+        Array.Sort(nums);
+        for (int i = 0; i < queries.Length; i++) {
+            result[i] = getSubsequent(nums, queries[i]);
+        }
+        return result;
+
+    }
+
+    public int getSubsequent(int[] nums,int query) {
+        int sum = 0;
+        for (int i = 0; i < nums.Length; i++) {
+            sum += nums[i];
+            if (sum > query) {
+                return i;
+            }
+        }
+        return nums.Length;
+    }
+}