分享一个大牛的人工智能教程。零基础!通俗易懂!风趣幽默!希望你也加入到人工智能的队伍中来!请轻击人工智能教程https://www.captainai.net/
// 面试题63:股票的最大利润
// 题目:假设把某股票的价格按照时间先后顺序存储在数组中,请问买卖交易该股
// 票可能获得的利润是多少?例如一只股票在某些时间节点的价格为{9, 11, 8, 5,
// 7, 12, 16, 14}。如果我们能在价格为5的时候买入并在价格为16时卖出,则能
// 收获最大的利润11。
#include <cstdio>
int MaxDiff(const int *numbers, unsigned length)
{
if (numbers == nullptr && length < 2)
return 0;
int min = numbers[0];
int maxDiff = numbers[1] - min;
for (int i = 2; i < length; ++i)
{
if (numbers[i - 1] < min)
min = numbers[i - 1];
int currentDiff = numbers[i] - min;
if (currentDiff > maxDiff)
maxDiff = currentDiff;
}
return maxDiff;
}
// ==================== Test Code ====================
void Test(const char *testName, const int *numbers, unsigned int length, int expected)
{
if (testName != nullptr)
printf("%s begins: ", testName);
if (MaxDiff(numbers, length) == expected)
printf("Passed.\n");
else
printf("FAILED.\n");
}
void Test1()
{
int numbers[] = {4, 1, 3, 2, 5};
Test("Test1", numbers, sizeof(numbers) / sizeof(int), 4);
}
// 价格递增
void Test2()
{
int numbers[] = {1, 2, 4, 7, 11, 16};
Test("Test2", numbers, sizeof(numbers) / sizeof(int), 15);
}
// 价格递减
void Test3()
{
int numbers[] = {16, 11, 7, 4, 2, 1};
Test("Test3", numbers, sizeof(numbers) / sizeof(int), -1);
}
// 价格全部相同
void Test4()
{
int numbers[] = {16, 16, 16, 16, 16};
Test("Test4", numbers, sizeof(numbers) / sizeof(int), 0);
}
void Test5()
{
int numbers[] = {9, 11, 5, 7, 16, 1, 4, 2};
Test("Test5", numbers, sizeof(numbers) / sizeof(int), 11);
}
void Test6()
{
int numbers[] = {2, 4};
Test("Test6", numbers, sizeof(numbers) / sizeof(int), 2);
}
void Test7()
{
int numbers[] = {4, 2};
Test("Test7", numbers, sizeof(numbers) / sizeof(int), -2);
}
void Test8()
{
Test("Test8", nullptr, 0, 0);
}
int main(int argc, char *argv[])
{
Test1();
Test2();
Test3();
Test4();
Test5();
Test6();
Test7();
Test8();
return 0;
}
// ------ Output ------
/*
Test1 begins: Passed.
Test2 begins: Passed.
Test3 begins: Passed.
Test4 begins: Passed.
Test5 begins: Passed.
Test6 begins: Passed.
Test7 begins: Passed.
Test8 begins: Passed.
*/