Help me in solving PEC005 problem

help
,
1

My issue

timeout --help

My code

import java.util.Arrays;

class Solution {
    public int lengthOfLIS(int[] nums) {
        int[] dp = new int[nums.length];
        int len = 0;
        for (int num : nums) {
            int i = Arrays.binarySearch(dp, 0, len, num);
            if (i < 0) {
                i = -(i + 1);
            }
            dp[i] = num;
            if (i == len) {
                len++;
            }
        }
        return len;
    }
}

Learning course: Placement preparation using Java
Problem Link: Longest Increasing Subsequence Practice Problem in Placement preparation using Java - CodeChef