Skip to content

Improved tasks 478, 497, 519 #1991

New issue

Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.

#

By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? # to your account

Merged
merged 1 commit into from
Jun 4, 2025
Merged

Improved tasks 478, 497, 519 #1991

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 0 additions & 14 deletions src/test/java/com_github_leetcode/CommonUtils.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,20 +6,6 @@

public class CommonUtils {

public static void printArray(int[] nums) {
for (int i : nums) {
System.out.print(i + ", ");
}
System.out.println();
}

public static void printArray(double[] nums) {
for (double i : nums) {
System.out.print(i + ", ");
}
System.out.println();
}

public static boolean compareArray(int[] arr1, int[] arr2) {
for (int i : arr1) {
boolean include = false;
Expand Down
7 changes: 3 additions & 4 deletions src/test/java/g0401_0500/s0478_generate_random_point_in_a_circle/SolutionTest.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,16 +3,15 @@
import static org.hamcrest.CoreMatchers.equalTo;
import static org.hamcrest.MatcherAssert.assertThat;

import com_github_leetcode.CommonUtils;
import org.junit.jupiter.api.Test;

class SolutionTest {
@Test
void randPoint() {
Solution solution = new Solution(1.0, 0.0, 0.0);
CommonUtils.printArray(solution.randPoint());
CommonUtils.printArray(solution.randPoint());
CommonUtils.printArray(solution.randPoint());
solution.randPoint();
solution.randPoint();
solution.randPoint();
assertThat(solution, equalTo(solution));
}
}
11 changes: 5 additions & 6 deletions src/test/java/g0401_0500/s0497_random_point_in_non_overlapping_rectangles/SolutionTest.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,18 +3,17 @@
import static org.hamcrest.CoreMatchers.equalTo;
import static org.hamcrest.MatcherAssert.assertThat;

import com_github_leetcode.CommonUtils;
import org.junit.jupiter.api.Test;

class SolutionTest {
@Test
void solutionTest() {
Solution solution = new Solution(new int[][] {{-2, -2, 1, 1}, {2, 2, 4, 6}});
CommonUtils.printArray(solution.pick());
CommonUtils.printArray(solution.pick());
CommonUtils.printArray(solution.pick());
CommonUtils.printArray(solution.pick());
CommonUtils.printArray(solution.pick());
solution.pick();
solution.pick();
solution.pick();
solution.pick();
solution.pick();
assertThat(true, equalTo(true));
}
}
9 changes: 4 additions & 5 deletions src/test/java/g0501_0600/s0519_random_flip_matrix/SolutionTest.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,18 +3,17 @@
import static org.hamcrest.CoreMatchers.equalTo;
import static org.hamcrest.MatcherAssert.assertThat;

import com_github_leetcode.CommonUtils;
import org.junit.jupiter.api.Test;

class SolutionTest {
@Test
void solutionTest() {
Solution solution = new Solution(3, 1);
CommonUtils.printArray(solution.flip());
CommonUtils.printArray(solution.flip());
CommonUtils.printArray(solution.flip());
solution.flip();
solution.flip();
solution.flip();
solution.reset();
CommonUtils.printArray(solution.flip());
solution.flip();
assertThat(true, equalTo(true));
}
}