Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Search in a rotated sorted array
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
//Searcch in a rotated sorted array class Solution { public: int search(vector<int>& nums, int target) { int s=0; int e=nums.size()-1; int mid; while(s<=e) { mid=(s+e)/2; if(nums[mid]==target) { return mid; } else if(nums[mid]>=nums[s]) { if(target>=nums[s] and target<=nums[mid]) { e=mid-1; } else { s=mid+1; } } else { if(target>=nums[mid] and target<=nums[e]) { s=mid+1; } else { e=mid-1; } } } return -1; } };
g++
Show compiler warnings
[
+
] Compiler args
[
+
]
Show input
edit mode
|
history
|
discussion