# ---
# title: 34. Find First and Last Position of Element in Sorted Array
# id: problem34
# author: Tian Jun
# date: 2020-10-31
# difficulty: Medium
# categories: Array, Binary Search
# link: <https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/description/>
# hidden: true
# ---
# 
# Given an array of integers `nums` sorted in ascending order, find the starting
# and ending position of a given `target` value.
# 
# If `target` is not found in the array, return `[-1, -1]`.
# 
# **Follow up:**  Could you write an algorithm with `O(log n)` runtime
# complexity?
# 
# 
# 
# **Example 1:**
# 
#     
#     
#     Input: nums = [5,7,7,8,8,10], target = 8
#     Output: [3,4]
#     
# 
# **Example 2:**
# 
#     
#     
#     Input: nums = [5,7,7,8,8,10], target = 6
#     Output: [-1,-1]
#     
# 
# **Example 3:**
# 
#     
#     
#     Input: nums = [], target = 0
#     Output: [-1,-1]
#     
# 
# 
# 
# **Constraints:**
# 
#   * `0 <= nums.length <= 105`
#   * `-109 <= nums[i] <= 109`
#   * `nums` is a non-decreasing array.
#   * `-109 <= target <= 109`
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
