280423

Author: aluferraz

src/Main.java

@@ -1,43 +1,18 @@
-import leetcode.editor.en.Q1014.BestSightseeingPair;
-import leetcode.editor.en.Q1051.HeightChecker;
-import leetcode.editor.en.Q115.DistinctSubsequences;
-import leetcode.editor.en.Q1218.LongestArithmeticSubsequenceOfGivenDifference;
-import leetcode.editor.en.Q122.BestTimeToBuyAndSellStockIi;
-import leetcode.editor.en.Q1416.RestoreTheArray;
-import leetcode.editor.en.Q152.MaximumProductSubarray;
-import leetcode.editor.en.Q1548.TheMostSimilarPathInAGraph;
-import leetcode.editor.en.Q1567.MaximumLengthOfSubarrayWithPositiveProduct;
-import leetcode.editor.en.Q1639.NumberOfWaysToFormATargetStringGivenADictionary;
-import leetcode.editor.en.Q2218.MaximumValueOfKCoinsFromPiles;
-import leetcode.editor.en.Q2402.MeetingRoomsIii;
-import leetcode.editor.en.Q2607.MakeKSubarraySumsEqual;
-import leetcode.editor.en.Q2641.CousinsInBinaryTreeIi;
-import leetcode.editor.en.Q459.RepeatedSubstringPattern;
-import leetcode.editor.en.Q461.HammingDistance;
-import leetcode.editor.en.Q516.LongestPalindromicSubsequence;
-import leetcode.editor.en.Q63.UniquePathsIi;
-import leetcode.editor.en.Q646.MaximumLengthOfPairChain;
-import leetcode.editor.en.Q673.NumberOfLongestIncreasingSubsequence;
-import leetcode.editor.en.Q71.SimplifyPath;
-import leetcode.editor.en.Q727.MinimumWindowSubsequence;
-import leetcode.editor.en.Q740.DeleteAndEarn;
-import leetcode.editor.en.Q879.ProfitableSchemes;
-import leetcode.editor.en.Q946.ValidateStackSequences;
+import leetcode.editor.en.Q1752.CheckIfArrayIsSortedAndRotated;
 import org.json.JSONArray;
 import org.json.JSONTokener;
 
 import java.io.IOException;
 import java.io.InputStream;
 import java.util.ArrayList;
-import java.util.Arrays;
 import java.util.LinkedList;
 import java.util.List;
 
 
 public class Main {
     public static void main(String[] args) throws IOException {
 
-        System.out.println(new LongestArithmeticSubsequenceOfGivenDifference().longestSubsequence(toIntArray("[7,-2,8,10,6,18,9,-8,-5,18,13,-6,-17,-1,-6,-9,9,9]\n"), 1));
+        System.out.println(new CheckIfArrayIsSortedAndRotated().check(toIntArray("[3,4,5,1,2]")));
 
     }
 

src/leetcode/editor/en/Q1752/CheckIfArrayIsSortedAndRotated.java

@@ -0,0 +1,92 @@
+package leetcode.editor.en.Q1752;
+
+import java.util.*;
+
+import javafx.util.Pair;
+
+//Given an array nums, return true if the array was originally sorted in non-
+//decreasing order, then rotated some number of positions (including zero). 
+//Otherwise, return false. 
+//
+// There may be duplicates in the original array. 
+//
+// Note: An array A rotated by x positions results in an array B of the same 
+//length such that A[i] == B[(i+x) % A.length], where % is the modulo operation. 
+//
+// 
+// Example 1: 
+//
+// 
+//Input: nums = [3,4,5,1,2]
+//Output: true
+//Explanation: [1,2,3,4,5] is the original sorted array.
+//You can rotate the array by x = 3 positions to begin on the the element of 
+//value 3: [3,4,5,1,2].
+// 
+//
+// Example 2: 
+//
+// 
+//Input: nums = [2,1,3,4]
+//Output: false
+//Explanation: There is no sorted array once rotated that can make nums.
+// 
+//
+// Example 3: 
+//
+// 
+//Input: nums = [1,2,3]
+//Output: true
+//Explanation: [1,2,3] is the original sorted array.
+//You can rotate the array by x = 0 positions (i.e. no rotation) to make nums.
+// 
+//
+// 
+// Constraints: 
+//
+// 
+// 1 <= nums.length <= 100 
+// 1 <= nums[i] <= 100 
+// 
+//
+// 👍 1723 👎 80
+
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+    public boolean check(int[] nums) {
+        int min = nums[0];
+        int minIdx = 0;
+
+        for (int i = 1; i < nums.length; i++) {
+            if (nums[i] < min) {
+                minIdx = i;
+                min = nums[i];
+            }
+        }
+        int modIdx = minIdx;
+        int prev = min;
+
+        int end = nums.length - 1;
+        while (end > 0 && nums[0] == nums[end]) {
+            end--;
+        }
+        if (nums.length == 1) return true;
+
+        for (int i = 0; i <= end; i++) {
+            modIdx = (modIdx + 1) % (end + 1);
+            if (modIdx == minIdx) break;
+            if (nums[modIdx] < prev) {
+                return false;
+            }
+            prev = nums[modIdx];
+        }
+        return true;
+
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+
+public class CheckIfArrayIsSortedAndRotated extends Solution {
+}