Update Check if Array Is Sorted and Rotated.java

varunu28 · web-flow · commit 8ca5525f53b1 · 2022-08-05T08:08:36.000-07:00
diff --git a/Easy/Check if Array Is Sorted and Rotated.java b/Easy/Check if Array Is Sorted and Rotated.java
@@ -1,17 +1,14 @@
 class Solution {
   public boolean check(int[] nums) {
-    boolean rotationFound = false;
+    boolean rotated = false;
     for (int i = 0; i < nums.length - 1; i++) {
       if (nums[i] > nums[i + 1]) {
-        if (rotationFound) {
+        if (rotated) {
           return false;
         }
-        rotationFound = true;
+        rotated = true;
       }
     }
-    if (rotationFound && nums[nums.length - 1] > nums[0]) {
-      return false;
-    }
-    return true;
+    return !rotated || nums[nums.length - 1] <= nums[0];
   }
 }

Original file line number	Diff line number	Diff line change
`@@ -1,17 +1,14 @@`
`1`	`1`	`class Solution {`
`2`	`2`	`public boolean check(int[] nums) {`
`3`		`- boolean rotationFound = false;`
	`3`	`+ boolean rotated = false;`
`4`	`4`	`for (int i = 0; i < nums.length - 1; i++) {`
`5`	`5`	`if (nums[i] > nums[i + 1]) {`
`6`		`- if (rotationFound) {`
	`6`	`+ if (rotated) {`
`7`	`7`	`return false;`
`8`	`8`	`}`
`9`		`- rotationFound = true;`
	`9`	`+ rotated = true;`
`10`	`10`	`}`
`11`	`11`	`}`
`12`		`- if (rotationFound && nums[nums.length - 1] > nums[0]) {`
`13`		`- return false;`
`14`		`- }`
`15`		`- return true;`
	`12`	`+ return !rotated \|\| nums[nums.length - 1] <= nums[0];`
`16`	`13`	`}`
`17`	`14`	`}`