dongwanpeng00的专栏

#include <iostream> #include <vector> using namespace std; int numberOfArithmeticSlices1(vector<int>& A) { vector<int> vec(A.size() - 2, 0); for (int i = 2; i < A.size...

//第一种方法:递归实现，代码简单，时间复杂高。 class Solution { public: int solve(int index, vector<int>&cost){ if (index <= 1){ return 0; } return min(solve(index - 1, cost) + cost[index - 1], solv...

// 太暴力了！！！ int maxProfit1(vector<int>& prices) { int diff = 0, maxdiff = INT_MIN; for (unsigned int i = 0; i <= prices.size() - 2; i++){ for (unsigned int j = 0; j <= prices.siz...