refactor 941

fishercoder1534 · fishercoder1534 · commit 444696cdd431 · 2020-12-10T06:09:40.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_941.java b/src/main/java/com/fishercoder/solutions/_941.java
@@ -2,28 +2,28 @@
 
 public class _941 {
     public static class Solution1 {
-        public boolean validMountainArray(int[] A) {
+        public boolean validMountainArray(int[] arr) {
             int i = 0;
-            for (; i < A.length - 1; i++) {
-                if (A[i] < A[i + 1]) {
+            for (; i < arr.length - 1; i++) {
+                if (arr[i] < arr[i + 1]) {
                     continue;
-                } else if (A[i] == A[i + 1]) {
+                } else if (arr[i] == arr[i + 1]) {
                     return false;
                 } else {
                     break;
                 }
             }
-            if (i == 0 || i >= A.length - 1) {
+            if (i == 0 || i >= arr.length - 1) {
                 return false;
             }
-            for (; i < A.length - 1; i++) {
-                if (A[i] > A[i + 1]) {
+            for (; i < arr.length - 1; i++) {
+                if (arr[i] > arr[i + 1]) {
                     continue;
                 } else {
                     return false;
                 }
             }
-            return i == A.length - 1;
+            return i == arr.length - 1;
         }
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -2,28 +2,28 @@`
`2`	`2`
`3`	`3`	`public class _941 {`
`4`	`4`	`public static class Solution1 {`
`5`		`- public boolean validMountainArray(int[] A) {`
	`5`	`+ public boolean validMountainArray(int[] arr) {`
`6`	`6`	`int i = 0;`
`7`		`- for (; i < A.length - 1; i++) {`
`8`		`- if (A[i] < A[i + 1]) {`
	`7`	`+ for (; i < arr.length - 1; i++) {`
	`8`	`+ if (arr[i] < arr[i + 1]) {`
`9`	`9`	`continue;`
`10`		`- } else if (A[i] == A[i + 1]) {`
	`10`	`+ } else if (arr[i] == arr[i + 1]) {`
`11`	`11`	`return false;`
`12`	`12`	`} else {`
`13`	`13`	`break;`
`14`	`14`	`}`
`15`	`15`	`}`
`16`		`- if (i == 0 \|\| i >= A.length - 1) {`
	`16`	`+ if (i == 0 \|\| i >= arr.length - 1) {`
`17`	`17`	`return false;`
`18`	`18`	`}`
`19`		`- for (; i < A.length - 1; i++) {`
`20`		`- if (A[i] > A[i + 1]) {`
	`19`	`+ for (; i < arr.length - 1; i++) {`
	`20`	`+ if (arr[i] > arr[i + 1]) {`
`21`	`21`	`continue;`
`22`	`22`	`} else {`
`23`	`23`	`return false;`
`24`	`24`	`}`
`25`	`25`	`}`
`26`		`- return i == A.length - 1;`
	`26`	`+ return i == arr.length - 1;`
`27`	`27`	`}`
`28`	`28`	`}`
`29`	`29`	`}`