Find first and last position of an element in a sorted array

Given an array of integers sorted in non-decreasing order and a target value, return the index of the first and the last occurrence of the target, or [-1, -1] when it is absent. The solution should run in O(log n), so use binary search rather than a scan.