fork download
  1.  
  2. import java.util.*;
  3.  
  4. class Ideone
  5. {
  6. public static void main(String[] args)
  7. {
  8. int nums[]={3,4,5,6,7,0,1,2};
  9. int target=7;
  10.  
  11. if(nums.length==1){
  12. if(target==nums[0]){
  13. System.out.println(0);
  14. }
  15. else{
  16. System.out.println(-1);
  17. }
  18. return;
  19. }
  20.  
  21. int min=findMin(nums);
  22.  
  23. int low=0;
  24. int high=nums.length-1;
  25.  
  26. int l=0;
  27. int r=0;
  28.  
  29. if(min==0){
  30. l=0;
  31. r=high;
  32. }
  33. else if(target>=nums[low] && target<=nums[min-1]){
  34. l=low;
  35. r=min-1;
  36. }
  37. else{
  38. l=min;
  39. r=high;
  40. }
  41.  
  42. int flag=0;
  43. int mid=0;
  44.  
  45. while(l<=r){
  46. mid=(l+r)/2;
  47.  
  48. if(nums[mid]==target){
  49. flag=1;
  50. break;
  51. }
  52. else if(nums[mid]<target){
  53. l=mid+1;
  54. }
  55. else{
  56. r=mid-1;
  57. }
  58. }
  59.  
  60. if(flag==1){
  61. System.out.println(mid);
  62. }
  63. else{
  64. System.out.println(-1);
  65. }
  66. }
  67.  
  68. public static int findMin(int []nums){
  69. int l=0;
  70. int r=nums.length-1;
  71.  
  72. while(l<r){
  73. int mid=(l+r)/2;
  74.  
  75. if(nums[mid]>nums[r]){
  76. l=mid+1;
  77. }
  78. else{
  79. r=mid;
  80. }
  81. }
  82.  
  83. return l;
  84. }
  85. }
  86.  
Success #stdin #stdout 0.07s 16508KB
stdin
Standard input is empty
stdout
4