摘要： 1 package leetcode; 2 3 public class demo_34 { 4 public int[] searchRange(int[] nums, int target) { 5 int[] s= {-1,-1}; 6 if(nums.length==0) {return s 阅读全文