systemboot的专栏

class Solution { public:     int maxProfit(vector &prices) {         // Note: The Solution object is instantiated only once and is reused by each test case.         int solution = 0;           

Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list. class Solution { publ

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down or right at

Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [3,2,1]. // RECURSIVE VERSION:

// NON-SWAP VERSION: class Solution { public:     vector > solution;     vector singleSolution;          void helper(vector & num, vector & visited){         if (singleSolution.size()==num.size

void helper(vector & solution, string & singleSolution,                 int numofleft, int numofright, int n){         if (singleSolution.size()==(2*n))             solution.push_back(singleSolutio

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For example: Given binary tree {3,9,20,#,#,15,7},

class Solution { public:     vector grayCode(int n) {         // Start typing your C/C++ solution below         // DO NOT write int main() function         vector result;               result.pu