[LeetCode]--34. Search for a Range

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].

public int[] searchRange(int[] nums, int target) {
        int low = 0, high = nums.length - 1, temp = -1;
        int result[] = new int[2];