Last Position of Target

Java

public class Solution {
    /*
     * @param nums: An integer array sorted in ascending order
     * @param target: An integer
     * @return: An integer
     */
    public int lastPosition(int[] nums, int target) {
        // write your code here
        if (nums == null || nums.length == 0) {
            return -1;
        }
        int start = 0;
        int end = nums.length - 1;
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (nums[mid] == target) {
                start = mid;
            } else if (nums[mid] < target) {
                start = mid;
            } else {
                end = mid;
            }
        }
        if (nums[end] == target) {
            return end;
        } else if (nums[start] == target) {
            return start;
        } else {
            return -1;
        }
    }
}

Python

class Solution:
    """
    @param nums: An integer array sorted in ascending order
    @param target: An integer
    @return: An integer
    """
    def lastPosition(self, nums, target):
        if not nums: 
            return -1 
            
        start = 0
        end = len(nums) - 1 
        
        while start + 1 < end:
            mid = start + (end - start) // 2 
            if target < nums[mid]: #接下来在左边找
                end = mid
            else: #在右边找
                start = mid 
        
        if target == nums[end]:
            return end 
        elif target == nums[start]:
            return start
        else:
            return -1