Skip to content

simplified solution search in rotated array #14

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Mar 14, 2017
Merged

simplified solution search in rotated array #14

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 14 additions & 13 deletions 81 Search in Rotated Sorted Array II.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -18,30 +18,31 @@
var search = function(nums, target) {
var start = 0;
var end = nums.length -1;

while(start <= end){
var mid = start + parseInt((end - start)/2);
if(nums[mid] === target){
var mid = parseInt((end + start)/2);

if(nums[mid] === target ){
return true;
}

if(nums[start] < nums[mid]){ // in correct order
if(target >= nums[start] && target < nums[mid]){ // normal order part

if(nums[start] === nums[mid]) {
start++;
} else if(nums[start] < nums[mid]){ // left part sorted
if(target >= nums[start] && target < nums[mid]){
end = mid - 1;
} else {
start = mid + 1;
}
} else if(nums[mid] < nums[start]) { // incorrect order
if(target <= nums[end] && target > nums[mid]){ // normal order part
} else { //right part sorted
if(target <= nums[end] && target > nums[mid]){ // normal order part
start = mid + 1;
} else {
end = mid -1;
}
} else {
start++;
}
}

return false;
};
};