Leetcode: Best time to buy and sell a stock I

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int buy=0,sell=0,max=0,min=0;
        for(int i=0;i<prices.size();++i){
            if(prices[i]<prices[min])
                min=i;
            int diff=prices[i]-prices[min];
            if(diff>max){
                buy=min;
                sell=i;
                max=diff;
            }
        }
        return max;
    }
};