there integer array num sort nondecrease order necessarily distinct valuesbefore pass function num rotate unknown pivot index k 0 k numslength result array numsk numsk1 numsn1 nums0 nums1 numsk1 0indexed for example 0124445667 rotate pivot index 5 4566701244given array num rotation integer target return true target num false numsYou decrease overall operation step possible Example 1input num 2560012 target 0output trueExample 2input nums 2560012 target 3output false Constraints1 numslength 5000104 numsi 104nums guarantee rotate pivot104 target 104 follow this problem similar Search rotate Sorted Array num contain duplicate would affect runtime complexity how