39. Combination Sum 求目标和的元素集合

摘要： 39. Combination Sum 问题描述 Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where th 阅读全文
posted @ 2017-03-20 08:09 达哥是超人 阅读(158) 评论(0) 推荐(0)

543. Diameter of Binary Tree 二叉树的直径

摘要： 543. Diameter of Binary Tree 问题描述 Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is th 阅读全文
posted @ 2017-03-19 20:17 达哥是超人 阅读(1682) 评论(0) 推荐(0)

538. Convert BST to Greater Tree 二叉搜索树转化为更大的树

摘要： 538. Convert BST to Greater Tree问题描述Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is... 阅读全文
posted @ 2017-03-19 17:06 达哥是超人 阅读(868) 评论(0) 推荐(0)

几道Leetcode题思路与代码

摘要： 226. Invert Binary Tree问题描述Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1思路1... 阅读全文
posted @ 2017-03-19 15:47 达哥是超人 阅读(215) 评论(0) 推荐(0)

排序算法总结

摘要： 排序算法总结1. 插入排序vector insertSort(vector nums){ const int n=nums.size(); for(int i=1;i=0;j--) { if(key >= nums[j]) ... 阅读全文
posted @ 2017-03-19 12:53 达哥是超人 阅读(140) 评论(0) 推荐(0)

leetCode:283.Move Zeros

摘要： 1. 问题英文描述： Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.... 阅读全文
posted @ 2016-08-13 12:15 达哥是超人 阅读(88) 评论(0) 推荐(0)

Note《Anchored Neighborhood Regression for Fast Example-Based Super-Resolution》

摘要： Note： Anchored NeighborhoodRegression for Fast Example-Based Super-Resolution 1. Abstract a) Propose fast super-resolutionmethods wh... 阅读全文
posted @ 2016-03-21 21:22 达哥是超人 阅读(186) 评论(0) 推荐(0)