72 number test case fail to compile in java

Problem:Given a sequence of n integers a1, a2, ..., an, a 132 pattern is a subsequence ai, aj, ak such that i < j < k and ai < ak < aj. Design an algorithm that takes a list of n numbers as input and checks whether there is a 132 pattern in the list.

Note: n will be less than 15,000.

Example 1:

Input: [1, 2, 3, 4]

Output: False

Explanation: There is no 132 pattern in the sequence. Example 2:

Input: [3, 1, 4, 2]

Output: True

Explanation: There is a 132 pattern in the sequence: [1, 4, 2].

Example 3: Input: [-1, 3, 2, 0]

Output: True

Explanation: There are three 132 patterns in the sequence: [-1, 3, 2], [-1, 3, 0] and [-1, 2, 0].

My code:

class Solution456{
public boolean find132pattern(int[] nums) {
    int i=0,j=i+1,k=j+1;
    if(nums.length<3){
        return false;
    }
    while(i<nums.length-2){
        if(nums[i]<nums[j] && nums[j]>nums[k]){
            return true;
        }
        else{
            i++;
            j++;
            k++;
        }
    }

    return false;

}
}

Which passes all the above mentioned testcases. But

Cannot pass this test case. I don't know why. For test case int [] nums={1,0,1,-4,-3}; at the second iteration nums[i](which is 0)< nums[j](which is 1) and nums[j]>nums[k](which is -4). So it has 132 pattern. Then why the Expected output will be false**? It should be true.

Can anyone explain me what is the bug in my code or logic?