2018年07月_Allenlzcoder

原创【DP】LeetCode 120. Triangle

LeetCode 120. TriangleSolution1：我的答案真费劲啊！！！啊！！！！！！class Solution {public: int minimumTotal(vector<vector<int>>& triangle) { if (!triangle.size() || !t...

2018-07-28 20:37:33 295

转载【贪心+双指针】LeetCode 11. Container With Most Water

LeetCode 11. Container With Most WaterSolution1：参考网址：http://www.cnblogs.com/grandyang/p/4455109.html 定义两个指针向中间走，贪心啊。。class Solution {//public: int maxArea(vector<int>& height) {...

2018-07-28 19:09:07 344

原创【贪心】LeetCode 3. Longest Substring Without Repeating Characters

LeetCode 3. Longest Substring Without Repeating CharactersSolution1：我的答案该方法中哈希表记录的是字符出现的次数。标准的贪心算法，超过80%的答案；如果哈希表记录字符出现的位置则还能进一步优化。class Solution {public: int lengthOfLongestSubstring(str...

2018-07-28 17:58:38 405

转载【DP + 卖股票】LeetCode 714. Best Time to Buy and Sell Stock with Transaction Fee

LeetCode 714. Best Time to Buy and Sell Stock with Transaction FeeSolution1：参考网址：http://www.cnblogs.com/grandyang/p/7776979.html sold[i]sold[i]sold[i]表示第iii天卖掉股票此时的最大利润，hold[i]hold[i]hold[i]表示第ii...

2018-07-26 15:46:13 292

转载【DP + 卖股票】LeetCode 309. Best Time to Buy and Sell Stock with Cooldown

LeetCode 309. Best Time to Buy and Sell Stock with CooldownSolution1: 比较有难度的一道动态规划题了！参考网址：http://zxi.mytechroad.com/blog/dynamic-programming/leetcode-309-best-time-to-buy-and-sell-stock-with-cool...

2018-07-26 14:46:21 179

转载【DP + 卖股票】LeetCode 188. Best Time to Buy and Sell Stock IV

LeetCode 188. Best Time to Buy and Sell Stock IVSolution1：我的答案

2018-07-25 15:27:51 513

转载【DP + 卖股票】LeetCode 123. Best Time to Buy and Sell Stock III

LeetCode 123. Best Time to Buy and Sell Stock IIISolution1:

2018-07-25 02:40:51 340

原创【贪心和 DP + 卖股票】LeetCode 122. Best Time to Buy and Sell Stock II

LeetCode 122. Best Time to Buy and Sell Stock IISolution1:我的答案贪心和DP傻傻分不清！class Solution {public: int maxProfit(vector<int>& prices) { int max_pro = 0, n = prices.size(); ...

2018-07-25 02:24:24 262

原创【贪心和 DP + 卖股票】LeetCode 121. Best Time to Buy and Sell Stock

LeetCode 121. Best Time to Buy and Sell StockSolution1:我的答案动态规划和贪心不要区分的那么明显嘛~~~class Solution {public: int maxProfit(vector<int>& prices) { int n = prices.size(); ...

2018-07-25 02:17:50 265

转载【贪心】LeetCode 55. Jump Game

LeetCode 45. Jump Game II参考网址：http://www.cnblogs.com/grandyang/p/4373533.html Solution1：贪心算法，这里贪婪并不是要在能跳的范围中选跳力最远的那个位置，因为这样选下来不一定是最优解，这么一说感觉又有点不像贪婪算法了。我们这里贪的是一个能到达的最远范围，我们遍历当前跳跃能到的所有位置，然后根据该位置上的跳...

2018-07-24 15:02:53 220

转载【贪心和 DP】LeetCode 55. Jump Game

LeetCode 55. Jump Game貌似一直就没做几个贪心的题，是时候好好学习一个了。。参考网址：http://www.cnblogs.com/grandyang/p/4371526.html Solution1：贪心时间复杂度O(n)O(n)O(n)，空间复杂度O(1)O(1)O(1) 贪婪算法Greedy Algorithm，因为我们并不是很关心每一个位置上的剩余步数，...

2018-07-24 11:39:11 393

转载【分治】LeetCode 69. Sqrt(x)

LeetCode 69. Sqrt(x)参考网址：http://www.cnblogs.com/grandyang/p/4346413.html Solution1：class Solution {public: int mySqrt(int x) { if (x <= 1) return x; int left = 0, right = ...

2018-07-24 00:07:08 195

原创【DFS + Backtracking】LeetCode 212. Word Search II

LeetCode 212. Word Search IISolution1:我的答案暴力搜索。。基于第79题的答案，真的是非常之慢啊！！！快的方法均是基于字典树的方法，真是复杂。。class Solution {public: vector<string> findWords(vector<vector<char>>& boar...

2018-07-23 22:32:20 428

原创【DFS + Backtracking】LeetCode 79. Word Search

LeetCode 79. Word Searchclass Solution {public: bool exist(vector&amp;amp;amp;lt;vector&amp;amp;amp;lt;char&amp;amp;amp;gt;&amp;amp;amp;gt;&amp;amp;amp;amp; board, string word) { int m = board.size();

2018-07-22 01:09:05 319

转载【DFS + backtrack】LeetCode 37. Sudoku Solver

LeetCode 37. Sudoku SolverSolution1：转载自花花酱：http://zxi.mytechroad.com/blog/searching/leetcode-37-sudoku-solver/ 与之前的DFS套路题不大一样，注意！class Solution {public: void solveSudoku(vector&lt;vector&l...

2018-07-20 13:35:55 378

转载 C++ int与string的相互转换

C++ int与string的相互转换本博客转载自：https://www.cnblogs.com/smile233/p/8379802.htmlint转换成stringto_string()函数c++11标准增加了全局函数std::to_string: string to_string (int val); string to_string (long val); st...

2018-07-20 00:01:02 382

原创【DFS + backtrack】LeetCode 93. Restore IP Addresses

LeetCode 93. Restore IP AddressesSolution1：我的答案怎么就这么慢。。。class Solution {public: vector&lt;string&gt; restoreIpAddresses(string s) { set&lt;string&gt; res; vector&lt;string...

2018-07-19 23:54:15 213

原创【动态规划】LeetCode 63. Unique Paths II

LeetCode 63. Unique Paths IISolution1：我的答案在哪里做过这题？class Solution {public: int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) { int m = obstacleGrid.size...

2018-07-19 23:09:17 483

转载【动态规划】LeetCode 62. Unique Paths

LeetCode 62. Unique PathsSolution1：我的未能AC的答案递归超时了！！！class Solution {public: int uniquePaths(int m, int n) { int res = 0; my_unique(n, m, res, 0, 0); return res; ...

2018-07-19 12:05:47 229

原创【BFS】LeetCode 130. Surrounded Regions

LeetCode 130. Surrounded RegionsSolution1：我的答案利用bfs解决，超过98.7%的答案，还不错。关键是简单易懂！class Solution {public: void solve(vector<vector<char>>& board) { if (!board.size() || !...

2018-07-18 10:02:37 224

转载【难点+重点BFS】LeetCode 126. Word Ladder II

LeetCode 126. Word Ladder II

2018-07-17 22:29:10 1670

转载【重点BFS】LeetCode 127. Word Ladder

Solution1：利用BFS做但是内存溢出未能AC，还是记录一下class Solution {public: int ladderLength(string beginWord, string endWord, vector&amp;amp;amp;amp;amp;lt;string&amp;amp;amp;amp;amp;gt;&amp;amp;amp;amp;amp;amp; wordList) { if (find(

2018-07-17 02:40:36 360

转载【动态规划】LeetCode 377. Combination Sum IV

Solution1: 我的未能AC的答案题目描述的和前几道题差不多，但实际上不能用DFS来做，要用动态规划，还是记录一下吧。。。class Solution {public: int combinationSum4(vector&amp;lt;int&amp;gt;&amp;amp; nums, int target) { int num = 0; vector&amp;lt;...

2018-07-16 22:00:45 257

原创【DFS + backtracking】LeetCode 216. Combination Sum III

Solution1：我的答案标准的DFSclass Solution {public: vector&amp;amp;amp;lt;vector&amp;amp;amp;lt;int&amp;amp;amp;gt;&amp;amp;amp;gt; combinationSum3(int k, int n) { vector&amp;amp;amp;lt;vector&amp;am

2018-07-16 19:00:24 153

原创【DFS】LeetCode 40. Combination Sum II

Combination Sum II Solution1：我的答案同39题class Solution {public: vector&amp;amp;amp;amp;lt;vector&amp;amp;amp;amp;lt;int&amp;amp;amp;amp;gt;&amp;amp;amp;amp;gt; combinationSum2(vector&amp;amp;amp;amp;lt;int&a

2018-07-16 18:45:51 172

原创【DFS】LeetCode 39. Combination Sum

LeetCode 39. Combination SumSolution1: DFS，这个套路要熟记啊！class Solution {public: vector<vector<int> > combinationSum(vector<int> &candidates, int target) { vector&lt...

2018-07-16 18:33:45 197

原创【DFS】LeetCode 77. Combinations

LeetCode 77. CombinationsSolution1：我的答案 DFS，时间复杂度O(n!)O(n!)O(n!)，空间复杂度O(n)O(n)O(n)class Solution {public: vector<vector<int>> combine(int n, int k) { vector<vector<...

2018-07-08 16:46:01 327

原创【暴力枚举】LeetCode 90. Subsets II

LeetCode 90. Subsets IIsolution1和2均是利用set的，3和4是不利用set的 Solution1：我的答案迭代法class Solution {public: vector&lt;vector&lt;int&gt;&gt; subsetsWithDup(vector&lt;int&gt;&amp; nums) { sort(n

2018-07-05 22:03:33 279

原创【暴力枚举】LeetCode 78. Subsets

LeetCode 78. SubsetsSolution1：我的答案迭代法，时间复杂度O(2n)O(2n)O(2^n)，空间复杂度O(1)O(1)O(1)class Solution {public: vector<vector<int>> subsets(vector<int>& nums) { vector&lt...

2018-07-05 14:24:04 438

原创 LeetCode 240. Search a 2D Matrix II

LeetCode 240. Search a 2D Matrix IISolution1: 为什么把第74题的代码改都不用改的拿过来就可以AC，一脸懵逼啊。。。class Solution {public: bool searchMatrix(vector<vector<int>>& matrix, int target) { i...

2018-07-05 11:06:15 171

原创 LeetCode 74. Search a 2D Matrix

LeetCode 74. Search a 2D MatrixSolution1：我的答案《剑指offer》原题class Solution {public: bool searchMatrix(vector<vector<int>>& matrix, int target) { if (!matrix.size() || !m...

2018-07-05 10:47:43 232

原创【二分法】LeetCode 35. Search Insert Position

LeetCode 35. Search Insert Position Solution1：我的答案class Solution {public: int searchInsert(vector<int>& nums, int target) { if (!nums.size()) return 0; int left = 0, ...

2018-07-05 10:36:31 138

原创 LeetCode 34. Search for a Range

LeetCode 34. Search for a RangeSolution1：我的答案竟然超过了100%，啊哈哈哈哈哈class Solution {public: vector&lt;int&gt; searchRange(vector&lt;int&gt;&amp; nums, int target) { vector&lt;int&gt; res =

2018-07-05 10:04:47 213

转载【排序】LeetCode 75. Sort Colors

LeetCode 75. Sort ColorsSolution1：参考自：《leetcode-cpp 答案》由于0，1，2非常紧凑，首先想到计数排序（counting sort），但需要扫描两遍，不符合题意【注意】能用原始数组就用原始数组，真的是比模板快好多class Solution {public: void sortColors(vector&amp;amp;lt;int&amp;amp;g...

2018-07-04 10:53:50 184

转载【排序+难题】LeetCode 41. First Missing Positive

LeetCode 41. First Missing Positive本博客转载自：[1]http://www.cnblogs.com/grandyang/p/4395963.html [2]https://www.cnblogs.com/clnchanpin/p/6727065.html 各种排序算法总结链接：https://blog.csdn.net/allenlzcoder/arti...

2018-07-03 23:58:25 292

原创【归并排序+递归】LeetCode 148. Sort List

LeetCode 148. Sort ListSolution1：我的答案很多递归/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }...

2018-07-03 14:56:49 1613

原创 LeetCode 147. Insertion Sort List

LeetCode 147. Insertion Sort ListSolution1：我的答案有点笨，有点慢/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(...

2018-07-03 10:20:20 215

原创 LeetCode 23. Merge k Sorted Lists

LeetCode 23. Merge k Sorted ListsSolution1：我的答案确实很慢啊/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NU...

2018-07-02 16:16:55 254

原创 LeetCode 21. Merge Two Sorted Lists

LeetCode 21. Merge Two Sorted ListsSolution1：我的答案 yeah~yeah~yeah~/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val...

2018-07-02 11:30:16 216

原创 LeetCode 88. Merge Sorted Array

88. Merge Sorted ArraySolution1：我的答案1class Solution {public: void merge(vector&lt;int&gt;&amp; nums1, int m, vector&lt;int&gt;&amp; nums2, int n) { if (!n) return; if (!m) { ...

2018-07-02 11:16:21 202

空空如也

空空如也