[LEET-0000] change names to match Leetcode updates

fishercoder1534 · fishercoder1534 · commit 8235a58bfd19 · 2017-02-13T08:04:49.000-08:00
diff --git a/leetcode-algorithms/README.md b/leetcode-algorithms/README.md
@@ -3,8 +3,8 @@
 ## Algorithms
 |  #  |      Title     |   Solutions   | Time          | Space         | Difficulty  | Tag          | Notes
 |-----|----------------|---------------|---------------|---------------|-------------|--------------|-----
-|515|[Find Largest Element in Each Row](https://leetcode.com/problems/find-largest-element-in-each-row/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/FindLargestElementinEachRow.java) | O(n) |O(k) | Medium| BFS
-|513|[Find Left Most Element](https://leetcode.com/problems/find-left-most-element/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/FindLeftMostElement.java) | O(n) |O(k) | Medium| BFS
+|515|[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/FindLargestElementinEachRow.java) | O(n) |O(k) | Medium| BFS
+|513|[Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/FindBottomLeftValue.java) | O(n) |O(k) | Medium| BFS
 |504|[Base 7](https://leetcode.com/problems/base-7/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/Base7.java) | O(1) |O(1) | Easy| 
 |501|[Find Mode in Binary Tree](https://leetcode.com/problems/find-mode-in-binary-tree/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/FindModeinBinaryTree.java) | O(n) |O(k) | Easy| Binary Tree
 |492|[Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/ConstructTheRectangle.java) | O(n) |O(1) | Easy| Array
diff --git a/leetcode-algorithms/src/main/java/com/stevesun/solutions/Base7.java b/leetcode-algorithms/src/main/java/com/stevesun/solutions/Base7.java
@@ -14,7 +14,7 @@
  */
 public class Base7 {
 
-    public String convertTo7(int num) {
+    public String convertToBase7(int num) {
         return String.valueOf(Integer.toString(num, 7));
     }
 }
diff --git a/leetcode-algorithms/src/main/java/com/stevesun/solutions/FindBottomLeftValue.java b/leetcode-algorithms/src/main/java/com/stevesun/solutions/FindBottomLeftValue.java
@@ -33,9 +33,9 @@
  7
  Note: You may assume the tree (i.e., the given root node) is not NULL.
  */
-public class FindLeftMostElement {
+public class FindBottomLeftValue {
 
-    public int findLeftMostNode(TreeNode root) {
+    public int findBottomLeftValue(TreeNode root) {
         Queue<TreeNode> queue = new LinkedList<>();
         queue.offer(root);
         TreeNode leftMost = root;
diff --git a/leetcode-algorithms/src/main/java/com/stevesun/solutions/FindLargestValueinEachTreeRow.java b/leetcode-algorithms/src/main/java/com/stevesun/solutions/FindLargestValueinEachTreeRow.java
@@ -21,9 +21,9 @@
 
  Output: [1, 3, 9]
  */
-public class FindLargestElementinEachRow {
+public class FindLargestValueinEachTreeRow {
 
-    public int[] findValueMostElement(TreeNode root) {
+    public int[] largestValues(TreeNode root) {
         Queue<TreeNode> queue = new LinkedList<>();
         if (root != null) {
             queue.offer(root);
diff --git a/leetcode-algorithms/src/test/java/com/stevesun/Base7Test.java b/leetcode-algorithms/src/test/java/com/stevesun/Base7Test.java
@@ -32,15 +32,15 @@ public void setupForEachTest(){
     public void test1(){
         num = 100;
         expected = "202";
-        actual = test.convertTo7(num);
+        actual = test.convertToBase7(num);
         assertEquals(expected, actual);
     }
 
     @Test
     public void test2(){
         num = -7;
         expected = "-10";
-        actual = test.convertTo7(num);
+        actual = test.convertToBase7(num);
         assertEquals(expected, actual);
     }
 }
diff --git a/leetcode-algorithms/src/test/java/com/stevesun/FindBottomLeftValueTest.java b/leetcode-algorithms/src/test/java/com/stevesun/FindBottomLeftValueTest.java
@@ -1,7 +1,7 @@
 package com.stevesun;
 
 import com.stevesun.common.classes.TreeNode;
-import com.stevesun.solutions.FindLeftMostElement;
+import com.stevesun.solutions.FindBottomLeftValue;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
@@ -11,15 +11,15 @@
 /**
  * Created by stevesun on 1/15/17.
  */
-public class FindLeftMostElementTest {
-    private static FindLeftMostElement test;
+public class FindBottomLeftValueTest {
+    private static FindBottomLeftValue test;
     private static int expected;
     private static int actual;
     private static TreeNode root;
 
     @BeforeClass
     public static void setup(){
-        test = new FindLeftMostElement();
+        test = new FindBottomLeftValue();
     }
 
     @Before
@@ -35,7 +35,7 @@ public void test1(){
         root.left = new TreeNode(1);
         root.right= new TreeNode(3);
         expected = 1;
-        actual = test.findLeftMostNode(root);
+        actual = test.findBottomLeftValue(root);
         assertEquals(expected, actual);
 
     }
@@ -50,7 +50,7 @@ public void test2(){
         root.right.right= new TreeNode(6);
         root.right.left.left= new TreeNode(7);
         expected = 7;
-        actual = test.findLeftMostNode(root);
+        actual = test.findBottomLeftValue(root);
         assertEquals(expected, actual);
     }
 }
diff --git a/leetcode-algorithms/src/test/java/com/stevesun/FindLargestValueinEachTreeRowTest.java b/leetcode-algorithms/src/test/java/com/stevesun/FindLargestValueinEachTreeRowTest.java
@@ -1,22 +1,22 @@
 package com.stevesun;
 
 import com.stevesun.common.classes.TreeNode;
-import com.stevesun.solutions.FindLargestElementinEachRow;
+import com.stevesun.solutions.FindLargestValueinEachTreeRow;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static org.junit.Assert.assertArrayEquals;
 
-public class FindLargestElementinEachRowTest {
-    private static FindLargestElementinEachRow test;
+public class FindLargestValueinEachTreeRowTest {
+    private static FindLargestValueinEachTreeRow test;
     private static int[] expected;
     private static int[] actual;
     private static TreeNode root;
 
     @BeforeClass
     public static void setup(){
-        test = new FindLargestElementinEachRow();
+        test = new FindLargestValueinEachTreeRow();
     }
 
     @Before
@@ -32,15 +32,15 @@ public void test1(){
         root.left = new TreeNode(3);
         root.right= new TreeNode(2);
         expected = new int[]{1, 3};
-        actual = test.findValueMostElement(root);
+        actual = test.largestValues(root);
         assertArrayEquals(expected, actual);
 
     }
 
     @Test
     public void test2(){
         expected = new int[]{};
-        actual = test.findValueMostElement(null);
+        actual = test.largestValues(null);
         assertArrayEquals(expected, actual);
 
     }

Original file line number	Diff line number	Diff line change
`@@ -14,7 +14,7 @@`
`14`	`14`	`*/`
`15`	`15`	`public class Base7 {`
`16`	`16`
`17`		`- public String convertTo7(int num) {`
	`17`	`+ public String convertToBase7(int num) {`
`18`	`18`	`return String.valueOf(Integer.toString(num, 7));`
`19`	`19`	`}`
`20`	`20`	`}`
Original file line number	Diff line number	Diff line change
`@@ -32,15 +32,15 @@ public void setupForEachTest(){`
`32`	`32`	`public void test1(){`
`33`	`33`	`num = 100;`
`34`	`34`	`expected = "202";`
`35`		`- actual = test.convertTo7(num);`
	`35`	`+ actual = test.convertToBase7(num);`
`36`	`36`	`assertEquals(expected, actual);`
`37`	`37`	`}`
`38`	`38`
`39`	`39`	`@Test`
`40`	`40`	`public void test2(){`
`41`	`41`	`num = -7;`
`42`	`42`	`expected = "-10";`
`43`		`- actual = test.convertTo7(num);`
	`43`	`+ actual = test.convertToBase7(num);`
`44`	`44`	`assertEquals(expected, actual);`
`45`	`45`	`}`
`46`	`46`	`}`