Leetcode: Best Time to Buy and Sell Stock

class Solution
{
public:
    int maxProfit(vector<int> &prices)
    {
        vector<int>::size_type size = prices.size();
        if (0 == size) return 0;
        int min = prices[0];
        int result = 0;
        for (size_t i = 1; i < size; ++i)
        {
            if (prices[i] < min) min = prices[i];
            else if (prices[i] - min > result) result = prices[i] - min;

        }
        return result;
    }
};

public class Solution
{
    public int MaxProfit(int[] prices)
    {
        if (prices.Length == 0) return 0;
        int min = prices[0];
        int result = 0;
        for (int i = 1; i < prices.Length; ++i)
        {
            if (prices[i] < min) min = prices[i];
            else if (prices[i] - min > result) result = prices[i] - min;
        }
        return result;
    }
}