learning
/
leetcode
mirror of https://github.com/doocs/leetcode.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fix: remove duplicate files (#4024) 

close #4023
This commit is contained in:
Libin YANG 2025-02-05 10:25:49 +08:00 committed by GitHub
parent 8aea3edb73
commit 705fcd39c8
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
2 changed files with 0 additions and 39 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
solution/1500-1599/1535.Find the Winner of an Array Game/solution.cs
View File

@ -1,17 +0,0 @@
public class Solution {
public int GetWinner(int[] arr, int k) {
int maxElement = arr[0], count = 0;
for (int i = 1; i < arr.Length; i++) {
if (maxElement < arr[i]) {
maxElement = arr[i];
count = 1;
} else {
count++;
}
if (count == k) {
break;
}
}
return maxElement;
}
}

22
solution/2300-2399/2389.Longest Subsequence With Limited Sum/solution.cs
View File

@ -1,22 +0,0 @@
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;
}
}