<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Maggie_2015的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Maggie_2015</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Maggie_2015]]></copyright><item><title><![CDATA[debug到自闭]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/102012068</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/102012068</guid><author>Maggie_2015</author><pubDate>Sun, 19 May 2019 11:56:00 +0800</pubDate><description><![CDATA[1 #include &lt;iostream&gt;
 2 #include &lt;algorithm&gt;
 3 #include &lt;cmath&gt;
 4 using namespace std;
 5 typedef long long LL;
 6 const int N = 1010;
 7 LL A[N];
 8 LL B[N];
 9 L...]]></description><category></category></item><item><title><![CDATA[大数乘法模拟]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/102012067</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/102012067</guid><author>Maggie_2015</author><pubDate>Thu, 16 May 2019 21:02:00 +0800</pubDate><description><![CDATA[1 // 手动模拟大整数乘法
 2 // 使用c++ 里的vector来储存数据
 3 // 并且倒着储存数字
 4 // 时间复杂度o(n2)
 5 void normalize(vector&lt;int&gt;&amp;  num){
 6     // n 位 * m 位相乘最多生成n + m位
 7     num.push_back(0);
 8     ...]]></description><category></category></item><item><title><![CDATA[线性同余方程]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/102012065</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/102012065</guid><author>Maggie_2015</author><pubDate>Thu, 16 May 2019 16:18:00 +0800</pubDate><description><![CDATA[// 定理一:对于方程a * x + b * y = c 有整数解 x, y 可以转化为a * x 三 c(mod b)
// 根据扩展欧几里得算法可知,a * x0 + b * y0 = GCD( a, b)一定有解, 此时将方程左右同时出去GCD( a, b)在乘上c
// 方程就转化成了a * x0 * c / GCD( a, b) + b * y0 * c / GCD( ...]]></description><category></category></item><item><title><![CDATA[121. Best Time to Buy and Sell Stock & 122  II & 123 III & 188 IV]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50740080</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50740080</guid><author>Maggie_2015</author><pubDate>Thu, 25 Feb 2016 19:49:30 +0800</pubDate><description><![CDATA[DP;Greedy]]></description><category></category></item><item><title><![CDATA[120. Triangle]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50650124</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50650124</guid><author>Maggie_2015</author><pubDate>Wed, 10 Feb 2016 19:30:46 +0800</pubDate><description><![CDATA[Given a triangle, find the minimum path sum from top to bottom.]]></description><category></category></item><item><title><![CDATA[118. Pascal's Triangle && 119. Pascal's Triangle II]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50639080</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50639080</guid><author>Maggie_2015</author><pubDate>Fri, 05 Feb 2016 21:01:53 +0800</pubDate><description><![CDATA[Given numRows, generate the first numRows of Pascal’s triangle]]></description><category></category></item><item><title><![CDATA[116. Populating Next Right Pointers in Each Node && 117.  II]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50631272</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50631272</guid><author>Maggie_2015</author><pubDate>Wed, 03 Feb 2016 21:34:38 +0800</pubDate><description><![CDATA[BFS]]></description><category></category></item><item><title><![CDATA[115. Distinct Subsequences]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630843</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630843</guid><author>Maggie_2015</author><pubDate>Wed, 03 Feb 2016 18:37:32 +0800</pubDate><description><![CDATA[Given a string S and a string T, count the number of distinct subsequences of T in S.]]></description><category></category></item><item><title><![CDATA[114. Flatten Binary Tree to Linked List]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630792</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630792</guid><author>Maggie_2015</author><pubDate>Wed, 03 Feb 2016 18:23:29 +0800</pubDate><description><![CDATA[Given a binary tree, flatten it to a linked list in-place]]></description><category></category></item><item><title><![CDATA[112. Path Sum && 113. Path Sum II]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630743</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630743</guid><author>Maggie_2015</author><pubDate>Wed, 03 Feb 2016 18:10:00 +0800</pubDate><description><![CDATA[Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.]]></description><category></category></item><item><title><![CDATA[111. Minimum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630600</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630600</guid><author>Maggie_2015</author><pubDate>Wed, 03 Feb 2016 17:44:30 +0800</pubDate><description><![CDATA[Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.]]></description><category></category></item><item><title><![CDATA[110. Balanced Binary Tree]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630569</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630569</guid><author>Maggie_2015</author><pubDate>Wed, 03 Feb 2016 17:38:10 +0800</pubDate><description><![CDATA[Given a binary tree, determine if it is height-balanced.]]></description><category></category></item><item><title><![CDATA[109. Convert Sorted List to Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630462</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630462</guid><author>Maggie_2015</author><pubDate>Wed, 03 Feb 2016 17:18:40 +0800</pubDate><description><![CDATA[Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.]]></description><category></category></item><item><title><![CDATA[108. Convert Sorted Array to Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630346</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630346</guid><author>Maggie_2015</author><pubDate>Wed, 03 Feb 2016 16:58:41 +0800</pubDate><description><![CDATA[Given an array where elements are sorted in ascending order, convert it to a height balanced BST.]]></description><category></category></item><item><title><![CDATA[106. Construct Binary Tree from Inorder and Postorder Traversal]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630282</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630282</guid><author>Maggie_2015</author><pubDate>Wed, 03 Feb 2016 16:49:47 +0800</pubDate><description><![CDATA[Given inorder and postorder traversal of a tree, construct the binary tree.]]></description><category></category></item><item><title><![CDATA[105. Construct Binary Tree from Preorder and Inorder Traversal]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630277</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50630277</guid><author>Maggie_2015</author><pubDate>Wed, 03 Feb 2016 16:48:18 +0800</pubDate><description><![CDATA[Given preorder and inorder traversal of a tree, construct the binary tree.]]></description><category></category></item><item><title><![CDATA[104. Maximum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50629267</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50629267</guid><author>Maggie_2015</author><pubDate>Wed, 03 Feb 2016 14:12:35 +0800</pubDate><description><![CDATA[Given a binary tree, find its maximum depth.]]></description><category></category></item><item><title><![CDATA[103. Binary Tree Zigzag Level Order Traversal]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50629242</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50629242</guid><author>Maggie_2015</author><pubDate>Wed, 03 Feb 2016 14:10:17 +0800</pubDate><description><![CDATA[Given a binary tree, return the zigzag level order traversal of its nodes’ values.]]></description><category></category></item><item><title><![CDATA[102. Binary Tree Level Order Traversal && 107. Binary Tree Level Order Traversal II]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50602014</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50602014</guid><author>Maggie_2015</author><pubDate>Thu, 28 Jan 2016 17:11:24 +0800</pubDate><description><![CDATA[层序遍历]]></description><category></category></item><item><title><![CDATA[101. Symmetric Tree]]></title><link>https://blog.youkuaiyun.com/Maggie_2015/article/details/50601890</link><guid>https://blog.youkuaiyun.com/Maggie_2015/article/details/50601890</guid><author>Maggie_2015</author><pubDate>Thu, 28 Jan 2016 17:00:01 +0800</pubDate><description><![CDATA[Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).]]></description><category></category></item></channel></rss>