LeetCode 2996: Smallest Missing Integer Greater Than Sequential Prefix Sum Solution

class Solution {
    public int smallestMissingInteger(int[] nums) {
        int longestSeqSum = nums[0];
        int currSeqSum = nums[0];
        
        for (int i = 1; i < nums.length; i++) {
            if (nums[i] == currSeqSum + 1) {
                currSeqSum = nums[i];
            } else {
                longestSeqSum = Math.max(longestSeqSum, currSeqSum);
                currSeqSum = nums[i];
            }
        }
        
        int smallestMissing = longestSeqSum + 1;
        while (smallestMissing <= 50 && Arrays.binarySearch(nums, smallestMissing) >= 0) {
            smallestMissing++;
        }
        
        return smallestMissing;
    }
}