2018年11月25日
Leetcode-113 Path Sum II(路径总和 II)
摘要： 1 class Solution 2 { 3 public: 4 vector> res; 5 int SUM; 6 void dfs(TreeNode* node,int tt,vector tmp) 7 { 8 vector tmp1 = tmp,tmp2 = tmp; 9 ... 阅读全文
posted @ 2018-11-25 20:23 Asurudo 阅读(154) 评论(0) 推荐(0)
Leetcode-946 验证栈序列(Validate Stack Sequences)
摘要： 1 class Solution 2 { 3 public: 4 bool validateStackSequences(vector& pushed, vector& popped) 5 { 6 stack s; 7 int pushedEnd = -1; 8 for... 阅读全文
posted @ 2018-11-25 18:10 Asurudo 阅读(334) 评论(0) 推荐(0)
Leetcode-945 Minimum Increment to Make Array Unique(使数组唯一的最小增量)
摘要： 1 class Solution 2 { 3 public: 4 int minIncrementForUnique(vector& A) 5 { 6 int a[90000] {0}; 7 for(int i = 0;i =2) 14 { 15 ... 阅读全文
posted @ 2018-11-25 16:36 Asurudo 阅读(271) 评论(0) 推荐(0)