@@ -0,0 +1,721 @@
+%22%22%22Leetcode 34. Find First and Last Position of Element in Sorted Array%0AMedium%0A%0AGiven an array of integers nums sorted in ascending order, %0Afind the starting and ending position of a given target value.%0A%0AYour algorithm's runtime complexity must be in the order of O(log n).%0A%0AIf the target is not found in the array, return %5B-1, -1%5D.%0A%0AExample 1:%0AInput: nums = %5B5,7,7,8,8,10%5D, target = 8%0AOutput: %5B3,4%5D%0A%0AExample 2:%0AInput: nums = %5B5,7,7,8,8,10%5D, target = 6%0AOutput: %5B-1,-1%5D%0A%22%22%22%0A%0Aclass Solution(object):%0A    def searchRange(self, nums, target):%0A        %22%22%22%0A        :type nums: List%5Bint%5D%0A        :type target: int%0A        :rtype: List%5Bint%5D%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc034_find_first_and_last_position_of_element_in_sorted_array.py