Top down DP Fibonacci

In the function fib, what was the need of an extra bucket "ans? can’t wewrite :-

dp[n] = fib(n-1)+fib(n-2);

return dp[n];

yes, you can it was just for ease of understanding