Update solution.cs

Author: yanglbme

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<queries.Length;i++){
-            result[i] = getSubsequent(nums,queries[i]);
+        for (int i = 0; i < queries.Length; i++) {
+            result[i] = getSubsequent(nums, queries[i]);
         }
         return result;
 
     }
 
-    public int getSubsequent(int[] nums,int query){
+    public int getSubsequent(int[] nums,int query) {
         int sum = 0;
-        for(int i=0;i<nums.Length;i++){
+        for (int i = 0; i < nums.Length; i++) {
             sum += nums[i];
-            if(sum > query){
+            if (sum > query) {
                 return i;
             }
         }
         return nums.Length;
     }
-}
+}