N-th Tribonacci Number LeetCode solution in Java

1
class Solution {
2
  public int tribonacci(int n) {
3
    if (n == 0) return 0;
4
    if (n == 1) return 1;
5
    if (n == 2) return 1;
6
    int p1 = 1;
7
    int p2 = 1;
8
    int p3 = 0;
9
    int cur = 0;
10
    for (int i = 3; i <= n; i++) {
11
      cur = p1 + p2 + p3;
12
      p3 = p2;
13
      p2 = p1;
14
      p1 = cur;
15
    }
16
    return cur;
17
  }
18
}