题目：
题解：
int maxProfit(int* prices, int pricesSize) {
if(pricesSize==0)return 0;
int dp[pricesSize][2];
memset(dp,0,sizeof(dp));
dp[0][0]=-prices[0];
dp[0][1]=0;
for(int i=1;i<pricesSize;i++){
dp[i][0]=fmax(dp[i-1][0],-prices[i]);
dp[i][1]=fmax(dp[i-1][1],dp[i-1][0]+prices[i]);
}
return dp[pricesSize-1][1];
}
![[Redis]Zset类型](https://img-blog.csdnimg.cn/direct/be9e257eb6794c4783d31acaaf30f303.png)
