121-简单-买股票的最佳时机

在这里插入图片描述
方法1 直接解题

int maxProfit(int* prices, int pricesSize) {
	int temp1 = 0;
    int temp2 = 0;
	for (int i = 0; i < pricesSize - 1; i++) {
		for (int j = i+1; j < pricesSize; j++) {
			if (prices[j] <= prices[i]){
				continue;
			}
            temp2 = prices[j] - prices[i];
			if (temp1 < temp2){
				temp1 = temp2;
			}
		}
	}
	return temp1;
}

猜你喜欢

转载自blog.csdn.net/lala0903/article/details/107739751