Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit7b53699

Browse files
[LEET-3318] add 3318
1 parent824958c commit7b53699

File tree

3 files changed

+84
-0
lines changed
  • paginated_contents/algorithms/4th_thousand
  • src

3 files changed

+84
-0
lines changed

‎paginated_contents/algorithms/4th_thousand/README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,6 @@
11
| # | Title | Solutions | Video | Difficulty | Tag
22
|------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------
3+
| 3318|[Find X-Sum of All K-Long Subarrays I](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3318.java)|| Easy|
34
| 3285|[Find Indices of Stable Mountains](https://leetcode.com/problems/find-indices-of-stable-mountains/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3285.java)|| Easy|
45
| 3264|[Final Array State After K Multiplication Operations I](https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3264.java)|| Easy|
56
| 3263|[Convert Doubly Linked List to Array I](https://leetcode.com/problems/convert-doubly-linked-list-to-array-i/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3263.java)|| Easy|
Lines changed: 53 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,53 @@
1+
packagecom.fishercoder.solutions.fourththousand;
2+
3+
importjava.util.HashMap;
4+
importjava.util.Map;
5+
importjava.util.PriorityQueue;
6+
7+
publicclass_3318 {
8+
publicstaticclassSolution1 {
9+
publicint[]findXSum(int[]nums,intk,intx) {
10+
PriorityQueue<int[]>maxHeap =newPriorityQueue<>((a,b) ->a[1] !=b[1] ?b[1] -a[1] :b[0] -a[0]);//a[0] is the number itself, a[1] is the frequency
11+
Map<Integer,int[]>map =newHashMap<>();
12+
inti =0;
13+
for (;i <k;i++) {
14+
int[]a =map.getOrDefault(nums[i],newint[2]);
15+
a[0] =nums[i];
16+
a[1]++;
17+
map.put(nums[i],a);
18+
}
19+
maxHeap.addAll(map.values());
20+
int[]ans =newint[nums.length -k +1];
21+
for (intj =i -1,p =0;j <nums.length; ) {
22+
ans[p++] =computeTopX(newPriorityQueue<>(maxHeap),x);
23+
24+
j++;
25+
if (j >=nums.length) {
26+
break;
27+
}
28+
int[]a =map.getOrDefault(nums[j],newint[2]);
29+
a[0] =nums[j];
30+
a[1]++;
31+
map.put(nums[j],a);
32+
33+
a =map.getOrDefault(nums[j -k],newint[2]);
34+
a[0] =nums[j -k];
35+
a[1]--;
36+
map.put(nums[j -k],a);
37+
38+
maxHeap.clear();
39+
maxHeap.addAll(map.values());
40+
}
41+
returnans;
42+
}
43+
44+
privateintcomputeTopX(PriorityQueue<int[]>maxHeap,intx) {
45+
intsum =0;
46+
while (!maxHeap.isEmpty() &&x-- >0) {
47+
int[]a =maxHeap.poll();
48+
sum +=a[0] *a[1];
49+
}
50+
returnsum;
51+
}
52+
}
53+
}
Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,30 @@
1+
packagecom.fishercoder.fourththousand;
2+
3+
importcom.fishercoder.solutions.fourththousand._3318;
4+
importorg.junit.jupiter.api.BeforeEach;
5+
importorg.junit.jupiter.api.Test;
6+
7+
importstaticorg.junit.jupiter.api.Assertions.assertArrayEquals;
8+
9+
publicclass_3318Test {
10+
11+
private_3318.Solution1solution1;
12+
privatestaticint[]nums;
13+
14+
@BeforeEach
15+
publicvoidsetup() {
16+
solution1 =new_3318.Solution1();
17+
}
18+
19+
@Test
20+
publicvoidtest1() {
21+
nums =newint[]{1,1,2,2,3,4,2,3};
22+
assertArrayEquals(newint[]{6,10,12},solution1.findXSum(nums,6,2));
23+
}
24+
25+
@Test
26+
publicvoidtest2() {
27+
nums =newint[]{3,8,7,8,7,5};
28+
assertArrayEquals(newint[]{11,15,15,15,12},solution1.findXSum(nums,2,2));
29+
}
30+
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp