From 20a172e47902d3a35f4b2ecc4cb770cf1e09f84a Mon Sep 17 00:00:00 2001 From: jahir509 Date: Sun, 29 Oct 2023 12:17:43 +0600 Subject: [PATCH 1/5] add c# solution --- .../README_EN.md | 28 +++++++++++++++++++ .../solution.cs | 22 +++++++++++++++ 2 files changed, 50 insertions(+) create mode 100644 solution/2300-2399/2389.Longest Subsequence With Limited Sum/solution.cs 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 index 62be4918ef0db..109d5ce7b798f 100644 --- 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,34 @@ impl Solution { } ``` + +### **C#** + +```c# +public class Solution { + public int[] AnswerQueries(int[] nums, int[] queries) { + int[] result = new int[queries.Length]; + Array.Sort(nums); + for(int i=0;i 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 new file mode 100644 index 0000000000000..94a2eeb583066 --- /dev/null +++ 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 query){ + return i; + } + } + return nums.Length; + } +} \ No newline at end of file From fe3ad0feef4c86da99693ed56647b95cfcd2a48b Mon Sep 17 00:00:00 2001 From: Jahir509 Date: Sun, 29 Oct 2023 06:19:36 +0000 Subject: [PATCH 2/5] style: format code and docs with prettier --- .../2389.Longest Subsequence With Limited Sum/README_EN.md | 1 - 1 file changed, 1 deletion(-) 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 index 109d5ce7b798f..49c2884ee9639 100644 --- 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,7 +279,6 @@ impl Solution { } ``` - ### **C#** ```c# From 146bc111db7ae84022fe6060e97d7206cb130d56 Mon Sep 17 00:00:00 2001 From: Libin YANG Date: Sun, 29 Oct 2023 23:05:35 +0800 Subject: [PATCH 3/5] Update README_EN.md --- .../README_EN.md | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) 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 index 49c2884ee9639..68a3789917d2e 100644 --- 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 @@ -281,23 +281,23 @@ impl Solution { ### **C#** -```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 query){ + if (sum > query) { return i; } } From 1d17823071fe2f7d5a825875498a6394964d6b13 Mon Sep 17 00:00:00 2001 From: Libin YANG Date: Sun, 29 Oct 2023 23:05:52 +0800 Subject: [PATCH 4/5] Update solution.cs --- .../solution.cs | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) 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 index 94a2eeb583066..17a35674faffb 100644 --- a/solution/2300-2399/2389.Longest Subsequence With Limited Sum/solution.cs +++ b/solution/2300-2399/2389.Longest Subsequence With Limited Sum/solution.cs @@ -2,21 +2,21 @@ public class Solution { public int[] AnswerQueries(int[] nums, int[] queries) { int[] result = new int[queries.Length]; Array.Sort(nums); - for(int i=0;i query){ + if (sum > query) { return i; } } return nums.Length; } -} \ No newline at end of file +} From 510f993cc8136b21e9f5269150380d2fd5b09227 Mon Sep 17 00:00:00 2001 From: Libin YANG Date: Sun, 29 Oct 2023 23:06:56 +0800 Subject: [PATCH 5/5] Update README.md --- .../README.md | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) 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 index bbfb540c7281c..4981996c8642d 100644 --- 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; + } +} +``` + ### **...** ```