Medium 122题 Best Time to Buy and Sell Stock II

Question:

Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock
before you buy again).

The difficult of this question is to understand the question.

As long as  I understand, i know how to solve it. The later is larger than the former one than we can consider it as profit because we can buy and sell multiple times.

public class Solution {
public int maxProfit(int[] prices) {
int ans=0;
for(int i=1;i<=prices.length-1;i++)
{
if(prices[i]>prices[i-1])
ans=ans+prices[i]-prices[i-1];
}
return ans;
}
}