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

Commitd421171

Browse files
[LEET-3379] add 3379
1 parent13c62b7 commitd421171

File tree

3 files changed

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

3 files changed

+61
-0
lines changed

‎paginated_contents/algorithms/4th_thousand/README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@
22
|------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------
33
| 3396|[Minimum Number of Operations to Make Elements in Array Distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3396.java)|| Easy|
44
| 3392|[Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3392.java)|| Easy|
5+
| 3379|[Transformed Array](https://leetcode.com/problems/transformed-array/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3379.java)|| Easy|
56
| 3375|[Minimum Operations to Make Array Values Equal to K](https://leetcode.com/problems/minimum-operations-to-make-array-values-equal-to-k/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3375.java)|| Easy|
67
| 3370|[Smallest Number With All Set Bits](https://leetcode.com/problems/smallest-number-with-all-set-bits/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3370.java)|| Easy|
78
| 3364|[Minimum Positive Sum Subarray](https://leetcode.com/problems/minimum-positive-sum-subarray/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3364.java)|| Easy|
Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
packagecom.fishercoder.solutions.fourththousand;
2+
3+
publicclass_3379 {
4+
publicstaticclassSolution1 {
5+
publicint[]constructTransformedArray(int[]nums) {
6+
int[]result =newint[nums.length];
7+
intlen =nums.length;
8+
for (inti =0;i <len;i++) {
9+
if (nums[i] >0) {
10+
intmoves =nums[i] %len;
11+
result[i] =nums[(i +moves) %len];
12+
}elseif (nums[i] <0) {
13+
if (i +nums[i] >=0) {
14+
result[i] =nums[i +nums[i]];
15+
}else {
16+
intmoves =Math.abs(nums[i]) %len;
17+
result[i] =nums[(len + (i -moves)) %len];
18+
}
19+
}else {
20+
result[i] =nums[i];
21+
}
22+
}
23+
returnresult;
24+
}
25+
}
26+
}
Lines changed: 34 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,34 @@
1+
packagecom.fishercoder.fourththousand;
2+
3+
importstaticorg.junit.jupiter.api.Assertions.assertArrayEquals;
4+
5+
importcom.fishercoder.solutions.fourththousand._3379;
6+
importorg.junit.jupiter.api.BeforeEach;
7+
importorg.junit.jupiter.api.Test;
8+
9+
publicclass_3379Test {
10+
private_3379.Solution1solution1;
11+
12+
@BeforeEach
13+
publicvoidsetup() {
14+
solution1 =new_3379.Solution1();
15+
}
16+
17+
@Test
18+
publicvoidtest1() {
19+
assertArrayEquals(
20+
newint[] {1,1,1,3},
21+
solution1.constructTransformedArray(newint[] {3, -2,1,1}));
22+
}
23+
24+
@Test
25+
publicvoidtest2() {
26+
assertArrayEquals(
27+
newint[] {-1, -1,4},solution1.constructTransformedArray(newint[] {-1,4, -1}));
28+
}
29+
30+
@Test
31+
publicvoidtest3() {
32+
assertArrayEquals(newint[] {-10},solution1.constructTransformedArray(newint[] {-10}));
33+
}
34+
}

0 commit comments

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