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

Commit5366d48

Browse files
authored
Added tasks 3701-3704
1 parented03e05 commit5366d48

File tree

20 files changed

+419
-8
lines changed

20 files changed

+419
-8
lines changed

‎src/main/java/g3601_3700/s3692_majority_frequency_characters/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
packageg3601_3700.s3692_majority_frequency_characters;
22

3-
// #Easy #Biweekly_Contest_166 #2025_09_28_Time_1_ms_(100.00%)_Space_43.06_MB_(100.00%)
3+
// #Easy #String #Hash_Table #Counting #Biweekly_Contest_166
4+
// #2025_10_07_Time_1_ms_(100.00%)_Space_42.89_MB_(97.01%)
45

56
publicclassSolution {
67
publicStringmajorityFrequencyGroup(Strings) {

‎src/main/java/g3601_3700/s3693_climbing_stairs_ii/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
packageg3601_3700.s3693_climbing_stairs_ii;
22

3-
// #Medium #Biweekly_Contest_166 #2025_09_28_Time_2_ms_(100.00%)_Space_57.06_MB_(100.00%)
3+
// #Medium #Array #Dynamic_Programming #Biweekly_Contest_166
4+
// #2025_10_07_Time_3_ms_(99.74%)_Space_58.06_MB_(96.52%)
45

56
@SuppressWarnings({"unused","java:S1172"})
67
publicclassSolution {

‎src/main/java/g3601_3700/s3694_distinct_points_reachable_after_substring_removal/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
packageg3601_3700.s3694_distinct_points_reachable_after_substring_removal;
22

3-
// #Medium #Biweekly_Contest_166 #2025_09_28_Time_37_ms_(100.00%)_Space_46.42_MB_(100.00%)
3+
// #Medium #String #Hash_Table #Prefix_Sum #Sliding_Window #Biweekly_Contest_166
4+
// #2025_10_07_Time_38_ms_(97.74%)_Space_46.84_MB_(98.59%)
45

56
importjava.util.HashSet;
67
importjava.util.Set;

‎src/main/java/g3601_3700/s3695_maximize_alternating_sum_using_swaps/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
packageg3601_3700.s3695_maximize_alternating_sum_using_swaps;
22

3-
// #Hard #Biweekly_Contest_166 #2025_09_28_Time_27_ms_(99.82%)_Space_106.96_MB_(100.00%)
3+
// #Hard #Array #Sorting #Greedy #Union_Find #Biweekly_Contest_166
4+
// #2025_10_07_Time_29_ms_(99.13%)_Space_106.44_MB_(52.69%)
45

56
importjava.util.ArrayList;
67
importjava.util.List;

‎src/main/java/g3601_3700/s3697_compute_decimal_representation/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
packageg3601_3700.s3697_compute_decimal_representation;
22

3-
// #Easy #Weekly_Contest_469 #2025_09_28_Time_1_ms_(100.00%)_Space_43.24_MB_(25.49%)
3+
// #Easy #Array #Math #Weekly_Contest_469 #2025_10_07_Time_1_ms_(100.00%)_Space_42.84_MB_(83.73%)
44

55
publicclassSolution {
66
publicint[]decimalRepresentation(intn) {

‎src/main/java/g3601_3700/s3698_split_array_with_minimum_difference/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
packageg3601_3700.s3698_split_array_with_minimum_difference;
22

3-
// #Medium #Weekly_Contest_469 #2025_09_28_Time_2_ms_(99.58%)_Space_62.78_MB_(7.35%)
3+
// #Medium #Array #Prefix_Sum #Weekly_Contest_469
4+
// #2025_10_07_Time_2_ms_(99.48%)_Space_62.63_MB_(12.47%)
45

56
publicclassSolution {
67
publiclongsplitArray(int[]nums) {

‎src/main/java/g3601_3700/s3699_number_of_zigzag_arrays_i/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
packageg3601_3700.s3699_number_of_zigzag_arrays_i;
22

3-
// #Hard #Weekly_Contest_469 #2025_09_28_Time_198_ms_(99.77%)_Space_43.67_MB_(99.32%)
3+
// #Hard #Dynamic_Programming #Prefix_Sum #Weekly_Contest_469
4+
// #2025_10_07_Time_197_ms_(97.34%)_Space_43.41_MB_(92.35%)
45

56
importjava.util.Arrays;
67

‎src/main/java/g3601_3700/s3700_number_of_zigzag_arrays_ii/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
packageg3601_3700.s3700_number_of_zigzag_arrays_ii;
22

3-
// #Hard #Weekly_Contest_469 #2025_09_28_Time_175_ms_(96.34%)_Space_45.46_MB_(28.66%)
3+
// #Hard #Dynamic_Programming #Math #Weekly_Contest_469
4+
// #2025_10_07_Time_173_ms_(92.39%)_Space_44.61_MB_(92.59%)
45

56
publicclassSolution {
67
publicintzigZagArrays(intn,intl,intr) {
Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
packageg3701_3800.s3701_compute_alternating_sum;
2+
3+
// #Easy #Weekly_Contest_470 #2025_10_05_Time_1_ms_(100.00%)_Space_44.28_MB_(66.67%)
4+
5+
publicclassSolution {
6+
publicintalternatingSum(int[]nums) {
7+
intsum =0;
8+
for (inti =0;i <nums.length;i++) {
9+
intnum =nums[i];
10+
if (i %2 ==0) {
11+
sum +=num;
12+
}else {
13+
sum -=num;
14+
}
15+
}
16+
returnsum;
17+
}
18+
}
Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
3701\. Compute Alternating Sum
2+
3+
Easy
4+
5+
You are given an integer array`nums`.
6+
7+
The**alternating sum** of`nums` is the value obtained by**adding** elements at even indices and**subtracting** elements at odd indices. That is,`nums[0] - nums[1] + nums[2] - nums[3]...`
8+
9+
Return an integer denoting the alternating sum of`nums`.
10+
11+
**Example 1:**
12+
13+
**Input:** nums =[1,3,5,7]
14+
15+
**Output:**\-4
16+
17+
**Explanation:**
18+
19+
* Elements at even indices are`nums[0] = 1` and`nums[2] = 5` because 0 and 2 are even numbers.
20+
* Elements at odd indices are`nums[1] = 3` and`nums[3] = 7` because 1 and 3 are odd numbers.
21+
* The alternating sum is`nums[0] - nums[1] + nums[2] - nums[3] = 1 - 3 + 5 - 7 = -4`.
22+
23+
**Example 2:**
24+
25+
**Input:** nums =[100]
26+
27+
**Output:** 100
28+
29+
**Explanation:**
30+
31+
* The only element at even indices is`nums[0] = 100` because 0 is an even number.
32+
* There are no elements on odd indices.
33+
* The alternating sum is`nums[0] = 100`.
34+
35+
**Constraints:**
36+
37+
*`1 <= nums.length <= 100`
38+
*`1 <= nums[i] <= 100`

0 commit comments

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