Skip to content

Python

LeetCode: 121-Best Time to Buy and Sell Stock 解題紀錄

You are given an array prices where prices[i] is the price of a given stock on the ith day.

You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.

Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.
Read More »LeetCode: 121-Best Time to Buy and Sell Stock 解題紀錄

[已解決][Python] 使用 Numpy 判斷時報錯:ValueError: The truth value of an array with more than one element is ambiguous. Use a.any() or a.all()

在使用 Numpy 格式的資料進行條件判斷時,有時我們會接收到以下報錯訊息:

ValueError: The truth value of an array with more than one element is ambiguous. Use a.any() or a.all()
Read More »[已解決][Python] 使用 Numpy 判斷時報錯:ValueError: The truth value of an array with more than one element is ambiguous. Use a.any() or a.all()