refactor 938

fishercoder1534 · fishercoder1534 · commit 42fe1173dd77 · 2020-03-11T06:58:35.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_938.java b/src/main/java/com/fishercoder/solutions/_938.java
@@ -12,18 +12,14 @@
  * The binary search tree is guaranteed to have unique values.
  *
  * Example 1:
- *
  * Input: root = [10,5,15,3,7,null,18], L = 7, R = 15
  * Output: 32
  *
- *
  * Example 2:
- *
  * Input: root = [10,5,15,3,7,13,18,1,null,6], L = 6, R = 10
  * Output: 23
  *
  * Note:
- *
  * The number of nodes in the tree is at most 10000.
  * The final answer is guaranteed to be less than 2^31.
  */

Original file line number	Diff line number	Diff line change
`@@ -12,18 +12,14 @@`
`12`	`12`	`* The binary search tree is guaranteed to have unique values.`
`13`	`13`	`*`
`14`	`14`	`* Example 1:`
`15`		`- *`
`16`	`15`	`* Input: root = [10,5,15,3,7,null,18], L = 7, R = 15`
`17`	`16`	`* Output: 32`
`18`	`17`	`*`
`19`		`- *`
`20`	`18`	`* Example 2:`
`21`		`- *`
`22`	`19`	`* Input: root = [10,5,15,3,7,13,18,1,null,6], L = 6, R = 10`
`23`	`20`	`* Output: 23`
`24`	`21`	`*`
`25`	`22`	`* Note:`
`26`		`- *`
`27`	`23`	`* The number of nodes in the tree is at most 10000.`
`28`	`24`	`* The final answer is guaranteed to be less than 2^31.`
`29`	`25`	`*/`