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

Commitae6b2f6

Browse files
refactor 593
1 parentbc318d7 commitae6b2f6

File tree

1 file changed

+0
-5
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+0
-5
lines changed

‎src/main/java/com/fishercoder/solutions/_593.java

Lines changed: 0 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -6,11 +6,6 @@
66

77
publicclass_593 {
88
publicstaticclassSolution1 {
9-
/**
10-
* Note: I don't need to use backtracking to find all permutations, this is an overkill.
11-
* This is the most easy one: https://leetcode.com/articles/kill-process-2/#approach-3-checking-every-case-accepted
12-
*/
13-
149
publicbooleanvalidSquare(int[]p1,int[]p2,int[]p3,int[]p4) {
1510
List<int[]>input =newArrayList<>(Arrays.asList(p1,p2,p3,p4));
1611
List<List<int[]>>allPermuations =getAllPermutations(input);

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp