Merge pull request #1831 from sora0319/main

sora0319 · web-flow · commit 152774e914ca · 2025-08-17T22:24:18.000+09:00
[sora0319] Week4 Solutions
diff --git a/3sum/sora0319.java b/3sum/sora0319.java
@@ -35,3 +35,4 @@ public List<List<Integer>> threeSum(int[] nums) {
     }
 }
 
+
diff --git a/coin-change/sora0319.java b/coin-change/sora0319.java
@@ -19,3 +19,4 @@ public int coinChange(int[] coins, int amount) {
 }
 
 
+
diff --git a/find-minimum-in-rotated-sorted-array/sora0319.java b/find-minimum-in-rotated-sorted-array/sora0319.java
@@ -19,3 +19,4 @@ public int findMin(int[] nums) {
     }
 }
 
+
diff --git a/maximum-depth-of-binary-tree/sora0319.java b/maximum-depth-of-binary-tree/sora0319.java
@@ -8,3 +8,4 @@ public int maxDepth(TreeNode root) {
     }
 }
 
+
diff --git a/merge-two-sorted-lists/sora0319.java b/merge-two-sorted-lists/sora0319.java
@@ -1,5 +1,4 @@
 /**
- * Definition for singly-linked list.
  * public class ListNode {
  *     int val;
  *     ListNode next;
@@ -38,3 +37,4 @@ public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
     }
 }
 
+
diff --git a/product-of-array-except-self/sora0319.java b/product-of-array-except-self/sora0319.java
@@ -19,3 +19,4 @@ public int[] productExceptSelf(int[] nums) {
     }
 }
 
+
diff --git a/validate-binary-search-tree/sora0319.java b/validate-binary-search-tree/sora0319.java
@@ -11,3 +11,4 @@ public boolean isvalid(TreeNode root,long min,long max)
     }
 }
 
+
diff --git a/word-search/sora0319.java b/word-search/sora0319.java
@@ -40,3 +40,4 @@ public boolean checkingWord(char[][] board, String word, boolean[][] visited, in
     }
 }
 
+

Original file line number	Diff line number	Diff line change
`@@ -35,3 +35,4 @@ public List<List<Integer>> threeSum(int[] nums) {`
`35`	`35`	`}`
`36`	`36`	`}`
`37`	`37`
	`38`	`+`
Original file line number	Diff line number	Diff line change
`@@ -19,3 +19,4 @@ public int coinChange(int[] coins, int amount) {`
`19`	`19`	`}`
`20`	`20`
`21`	`21`
	`22`	`+`
Original file line number	Diff line number	Diff line change
`@@ -8,3 +8,4 @@ public int maxDepth(TreeNode root) {`
`8`	`8`	`}`
`9`	`9`	`}`
`10`	`10`
	`11`	`+`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,4 @@`
`1`	`1`	`/**`
`2`		`- * Definition for singly-linked list.`
`3`	`2`	`* public class ListNode {`
`4`	`3`	`* int val;`
`5`	`4`	`* ListNode next;`
`@@ -38,3 +37,4 @@ public ListNode mergeTwoLists(ListNode list1, ListNode list2) {`
`38`	`37`	`}`
`39`	`38`	`}`
`40`	`39`
	`40`	`+`
Original file line number	Diff line number	Diff line change
`@@ -19,3 +19,4 @@ public int[] productExceptSelf(int[] nums) {`
`19`	`19`	`}`
`20`	`20`	`}`
`21`	`21`
	`22`	`+`
Original file line number	Diff line number	Diff line change
`@@ -11,3 +11,4 @@ public boolean isvalid(TreeNode root,long min,long max)`
`11`	`11`	`}`
`12`	`12`	`}`
`13`	`13`
	`14`	`+`
Original file line number	Diff line number	Diff line change
`@@ -40,3 +40,4 @@ public boolean checkingWord(char[][] board, String word, boolean[][] visited, in`
`40`	`40`	`}`
`41`	`41`	`}`
`42`	`42`
	`43`	`+`