qw___的博客

106. Construct Binary Tree from Inorder and Postorder Traversal/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeN

105. Construct Binary Tree from Preorder and Inorder Traversal/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNo

78. Subsetsclass Solution {public: vector<vector<int>> subsets(vector<int>& nums) { vector<vector<int> > v; vector<int> temp; int length = nums.size(); for(int

62. Unique Paths 求解Start到Finish路径的总和，只允许从起点位置向下或者向右移动。 设v为路径统计矩阵，v[i][j]为经过i，j位置的路径总数。 状态转移方程：v[i][j] = v[i-1][j] + v[i][j-1];class Solution {public: int uniquePaths(int m, int n) { v

63. Unique Paths II 原地解法：class Solution {public: int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) { int m = obstacleGrid.size(); int n = obstacleGrid[0].size()

有n份作业分配给n个人去完成，每人完成一份作业。假定第i个人完成第j份作业需要花费cij时间， cij>0,1≦i,j≦n。试设计一个回溯算法，将n份作业分配给n个人完成，使得总花费时间最短。 C++实现：/* * Author: qinwu * Created Time: 2017/4/30 22:45:25 * File Name: Solution.cpp */#include