LeetCode_34---Search for a Range

最新推荐文章于 2022-12-30 11:28:20 发布

小学生Jason

最新推荐文章于 2022-12-30 11:28:20 发布

阅读量347

点赞数

分类专栏： LeetCode 文章标签：算法 LeetCode java

本文链接：https://blog.csdn.net/bingbing8219/article/details/46516537

版权

LeetCode 专栏收录该内容

73 篇文章 0 订阅

订阅专栏

Given a sorted array of integers, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].

Hide Tags

Array Binary Search

翻译：

Code:

package From21;

import java.util.ArrayList;
import java.util.Arrays;

/**
 * @author MohnSnow
 * @time 2015年6月16日 下午12:02:01
 * 
 */
public class LeetCode34 {

	/**
	 * @param argsmengdx
	 *            -fnst
	 */
	//412msA---416msA
	public static int[] searchRange(int[] nums, int target) {
		int[] result = { -1, -1 };
		if (nums.length == 0)
			return result;
		int i = 0;
		int j = nums.length - 1;
		while (i <= j) {
			if (nums[i] == target && nums[j] == target) {
				result[0] = i;
				result[1] = j;
				System.out.println("寻找11：" + Arrays.toString(result));
				return result;
			} else if (nums[i] == target && nums[j] != target) {
				System.out.println("寻找22：" + Arrays.toString(result));
				result[0] = i;
				j--;
			} else if (nums[i] != target && nums[j] == target) {
				System.out.println("寻找33：" + Arrays.toString(result));
				result[1] = j;
				i++;
			} else {
				System.out.println("寻找44：" + Arrays.toString(result));
				i++;
				j--;
			}
		}
		return result;
	}

	public static void main(String[] args) {
		//int[] nums = { 3, 5, 5, 7, 7, 8, 8, 8, 10 };
		int[] nums = { 3 };
		int target = 7;
		System.out.println("寻找：" + Arrays.toString(searchRange(nums, target)));
	}

}