Commit11409c6

committed

add 2236

1 parent182d6e3 commit11409c6Copy full SHA for 11409c6

File tree

+12

-0

lines changed

+12

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -16,6 +16,7 @@ _If you like this project, please leave me a star._ ★`
`16`	`16`	`\| 2244\|[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/)\|[Java](../master/src/main/java/com/fishercoder/solutions/_2244.java)\|\| Medium\|\|`
`17`	`17`	`\| 2243\|[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/)\|[Java](../master/src/main/java/com/fishercoder/solutions/_2243.java)\|\| Easy\|\|`
`18`	`18`	`\| 2239\|[Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero/)\|[Java](../master/src/main/java/com/fishercoder/solutions/_2239.java)\|\| Easy\|\|`
	`19`	`+\| 2236\|[Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children/)\|[Java](../master/src/main/java/com/fishercoder/solutions/_2236.java)\|\| Easy\|\|`
`19`	`20`	`\| 2220\|[Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/)\|[Java](../master/src/main/java/com/fishercoder/solutions/_2220.java)\|\| Easy\|\|`
`20`	`21`	`\| 2215\|[Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/)\|[Java](../master/src/main/java/com/fishercoder/solutions/_2215.java)\|\| Easy\|\|`
`21`	`22`	`\| 2210\|[Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/)\|[Java](../master/src/main/java/com/fishercoder/solutions/_2210.java)\|\| Easy\|\|`

Lines changed: 11 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,11 @@`
	`1`	`+packagecom.fishercoder.solutions;`
	`2`	`+`
	`3`	`+importcom.fishercoder.common.classes.TreeNode;`
	`4`	`+`
	`5`	`+publicclass_2236 {`
	`6`	`+publicstaticclassSolution1 {`
	`7`	`+publicbooleancheckTree(TreeNoderoot) {`
	`8`	`+returnroot.val ==root.left.val +root.right.val;`
	`9`	`+ }`
	`10`	`+ }`
	`11`	`+}`

Comments

(0)