![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
码农130
这个作者很懒,什么都没留下…
展开
-
Leetcode46 全排列
leetcode46原创 2018-11-20 15:11:17 · 311 阅读 · 0 评论 -
LeetCode297二叉树的序列化 2018_1209_2107
class Codec {public: // Encodes a tree to a single string. string serialize(TreeNode* root) { if(root==nullptr) return nullptr; //返回nullptr,返回NULL,应改为返回"" queue<TreeNode*...原创 2018-12-09 21:17:46 · 244 阅读 · 0 评论 -
LeetCode226翻转二叉树
class Solution {public: TreeNode* invertTree(TreeNode *pRoot) { if(pRoot==nullptr) return nullptr; queue<TreeNode*> qu; qu.push(pRoot); while(!qu.empty())...原创 2018-12-13 23:28:16 · 116 阅读 · 0 评论 -
LeetCode82删除链表中重复的节点2018_1205_0226 ;2018_1206_1555
class Solution { public: ListNode* deleteDuplicates(ListNode* head) { if(!head) return nullptr; if(head-&amp;amp;gt;next==nullptr) return head; ListNode helpNode(0); helpNode.next=head...原创 2018-12-06 02:27:23 · 167 阅读 · 1 评论 -
LeetCode322零钱兑换2018_1207_1624
dp[i]代表要凑齐总数为i的钱所需要的最少硬币数dp[i]=min(dp[i]-coins[j])+1 for all jclass Solution {public: int coinChange(vector&lt;int&gt;&amp; coins, int amount) { int min=0x7fffffff; vector&lt;in...原创 2018-12-07 17:01:37 · 167 阅读 · 0 评论 -
LeetCode83. 删除排序链表中的重复元素2018_1205_1128
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* de...原创 2018-12-05 11:27:20 · 155 阅读 · 0 评论 -
LeetCode21合并二个排序链表
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* me...原创 2018-12-04 22:26:00 · 89 阅读 · 0 评论 -
LeetCode206反转链表
写出整体,回头边界检查,2个节点,1个节点,0个节点这次漏了/*struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) { }};*/class Solution {public: ListNode* ReverseList(ListNode* pH...原创 2018-12-04 18:45:56 · 142 阅读 · 0 评论 -
LeetCode300 最长上升子序列2018_1125
class Solution {public: int lengthOfLIS(vector&amp;lt;int&amp;gt;&amp;amp; nums) { vector&amp;lt;int&amp;gt; dp(nums.size()); if(nums.empty()) return 0; dp[0]=1; int ans=1;原创 2018-11-25 18:01:45 · 106 阅读 · 0 评论 -
DP总结
1.dp[i]代表以第i个元素结尾的…dp[i]跟前面的dp[0],dp[1],…,dp[i-1]都有关系,其实是跟前面所有dp中的最值有关系最长上升子序列dp[i]代表以i结尾的最长上升子序列2.二维dp,二维数组中与对角线平行的前一层和后一层之间的递推关系(以经过对角线的一层和接下来的一层为基础)最长回文子串dp[i][j]代表以i开头,j结尾的子串是否是回文3.dp[i]代表以第...原创 2018-11-25 17:35:50 · 200 阅读 · 0 评论 -
LeetCode15三数和2018_11.24_11.30
class Solution {public: vector&amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;lt;vector&amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;lt;int&amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;gt原创 2018-11-24 11:29:18 · 118 阅读 · 0 评论 -
LeetCode1 二数和 2018.11.22_10.39
//2018.11.22_10.39class Solution {public: vector&amp;amp;lt;int&amp;amp;gt; twoSum(vector&amp;amp;lt;int&amp;amp;gt;&amp;amp;amp; nums, int target) { unordered_map&amp;amp;lt;int,int&amp原创 2018-11-22 10:41:19 · 85 阅读 · 0 评论 -
LeetCode1 二数和
class Solution {private: struct package{ public: int num; int pos; //package(int _num,int _pos):this-&amp;gt;num(_num),this-&amp;gt;pos(_pos){} pac...原创 2018-11-21 20:45:07 · 90 阅读 · 0 评论 -
LeetCode77 组合
C++class Solution {public: void dfs(vector&amp;amp;lt;vector&amp;amp;lt;int&amp;amp;gt;&amp;amp;gt;&amp;amp;amp; res,int k,int layer,vector&amp;amp;lt;int&amp;amp;gt;&amp;amp;amp; temp,i原创 2018-11-21 18:10:13 · 107 阅读 · 1 评论 -
LeetCode3 无重复字符的最长子串
dp[i]代表以&amp;amp;amp;amp;amp;amp;amp;amp;lt;font color=red size=3&amp;amp;amp;amp;amp;amp;amp;amp;gt;以s[i]结尾的&amp;amp;amp;amp;amp;amp;amp;amp;lt;/font&amp;amp;amp;amp;amp;amp;amp;amp;gt;最长无重复字符的子串class Solution {public: i原创 2018-11-21 14:39:26 · 152 阅读 · 0 评论 -
leetcode链表快排
待写转载 2019-04-22 22:27:22 · 644 阅读 · 2 评论