Find the Minimum Number of Fibonacci Numbers Whose Sum Is K LeetCode solution in Java

1
class Solution {
2
  public int findMinFibonacciNumbers(int k) {
3
    int ans = 0;
4

5
    while (k > 0) {
6
      // Run until solution is reached
7
      int fib2prev = 1;
8
      int fib1prev = 1;
9
      while (fib1prev <= k) {
10
        // Generate Fib values, stop when fib1prev is > k, we have the fib number we want stored in
11
        // fib2prev
12
        int temp = fib2prev + fib1prev;
13
        fib2prev = fib1prev;
14
        fib1prev = temp;
15
      }
16
      k -= fib2prev;
17
      ans += 1;
18
    }
19
    return ans;
20
  }
21
}