<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wdnmdpy的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wdnmdpy</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wdnmdpy]]></copyright><item><title><![CDATA[二叉树的最金公共祖先]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/105848840</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/105848840</guid><author>wdnmdpy</author><pubDate>Wed, 29 Apr 2020 21:08:23 +0800</pubDate><description><![CDATA[class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if (!root || root == p || root == q) return root;
        TreeNode *left = lowestCommonA...]]></description><category></category></item><item><title><![CDATA[二叉树的最大深度]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/105848225</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/105848225</guid><author>wdnmdpy</author><pubDate>Wed, 29 Apr 2020 20:38:32 +0800</pubDate><description><![CDATA[递归
class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(root==nullptr)return 0;
        return(max(maxDepth(root-&gt;left),maxDepth(root-&gt;right)))+1;
    }
};

]]></description><category></category></item><item><title><![CDATA[对称二叉树]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/105847016</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/105847016</guid><author>wdnmdpy</author><pubDate>Wed, 29 Apr 2020 19:27:54 +0800</pubDate><description><![CDATA[递归
class Solution{
public:
    bool isSymmetric(TreeNode* root) {
        if(!root) return true;
        return m(root-&gt;left,root-&gt;right);
        }
        bool m(TreeNode*r1,TreeNode*r2)
     ...]]></description><category></category></item><item><title><![CDATA[相同的树]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/105846163</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/105846163</guid><author>wdnmdpy</author><pubDate>Wed, 29 Apr 2020 18:31:25 +0800</pubDate><description><![CDATA[递归就很简单了
class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        if(!p&amp;&amp;!q) return true;
        if(!p||!q) return false;
        return (p-&gt;val==q-&gt;val&amp;&amp;...]]></description><category></category></item><item><title><![CDATA[子集]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/105641012</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/105641012</guid><author>wdnmdpy</author><pubDate>Mon, 20 Apr 2020 18:03:13 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector&lt;vector&lt;int&gt;&gt; subsets(vector&lt;int&gt;&amp; nums) {
        vector&lt;vector&lt;int&gt;&gt; ans;
        for (int num : nums) {
            int n = ans....]]></description><category></category></item><item><title><![CDATA[格雷编码]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/105640351</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/105640351</guid><author>wdnmdpy</author><pubDate>Mon, 20 Apr 2020 17:36:13 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector&lt;int&gt; grayCode(int n) {
        vector&lt;int&gt; res;
        for(int i=0;i&lt;=n;i++)
        {
             if(res.size()==0)
             {res.push_back(0)...]]></description><category></category></item><item><title><![CDATA[只出现一次的数字]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/105370414</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/105370414</guid><author>wdnmdpy</author><pubDate>Tue, 07 Apr 2020 18:08:24 +0800</pubDate><description><![CDATA[class Solution {
public:
    int singleNumber(vector&lt;int&gt;&amp; nums) {
        int j=0;
        for(int i=0;i&lt;nums.size();i++)
        {
            for(j=i+1;j&lt;nums.size();j++)
          ...]]></description><category></category></item><item><title><![CDATA[反串字符串]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/105369739</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/105369739</guid><author>wdnmdpy</author><pubDate>Tue, 07 Apr 2020 17:42:58 +0800</pubDate><description><![CDATA[class Solution {
public:
    void reverseString(vector&lt;char&gt;&amp; s) {
        int n=s.size();
        for(int i=0;i&lt;n/2;i++)
        {
            if(s[i]==s[n-1-i])  continue;       //优化
  ...]]></description><category></category></item><item><title><![CDATA[最长前缀]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/105369618</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/105369618</guid><author>wdnmdpy</author><pubDate>Tue, 07 Apr 2020 17:38:21 +0800</pubDate><description><![CDATA[class Solution {
public:
    string longestCommonPrefix(vector&lt;string&gt;&amp; strs) {
        string r = strs.size() ? strs[0] : "";
        for(auto s: strs){
            while(s.substr(0, r.size...]]></description><category></category></item><item><title><![CDATA[滑动窗口最大值]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/105120980</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/105120980</guid><author>wdnmdpy</author><pubDate>Thu, 26 Mar 2020 16:05:16 +0800</pubDate><description><![CDATA[class Solution 
{public:vector&lt;int&gt; maxSlidingWindow(vector&lt;int&gt;&amp; nums, int k) 
{    vector&lt;int&gt; res;
    if (nums.size() == 0)    
    {        
    return res;    
    }    
  ...]]></description><category></category></item><item><title><![CDATA[设计循环双端队列]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/105102529</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/105102529</guid><author>wdnmdpy</author><pubDate>Wed, 25 Mar 2020 23:26:19 +0800</pubDate><description><![CDATA[用vector很好实现
内存占用少但费时
class MyCircularDeque {
vector&lt;int&gt;deque;
int max_size;
public:/** Initialize your data structure here. 
Set the size of the deque to be k. 
*/MyCircularDeque(int k) {max_si...]]></description><category></category></item><item><title><![CDATA[逆波兰表达式求值]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/105093384</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/105093384</guid><author>wdnmdpy</author><pubDate>Wed, 25 Mar 2020 13:45:43 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[整数反转]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/105093236</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/105093236</guid><author>wdnmdpy</author><pubDate>Wed, 25 Mar 2020 13:38:25 +0800</pubDate><description><![CDATA[要注意这个题的数是有范围的，超过了就要返回0



]]></description><category></category></item><item><title><![CDATA[最小栈]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/104955326</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/104955326</guid><author>wdnmdpy</author><pubDate>Wed, 18 Mar 2020 22:10:01 +0800</pubDate><description><![CDATA[用两个栈，一个栈用来储存数据，一个用来储存最小的数



]]></description><category></category></item><item><title><![CDATA[有效的括号]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/104931385</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/104931385</guid><author>wdnmdpy</author><pubDate>Tue, 17 Mar 2020 21:16:13 +0800</pubDate><description><![CDATA[用栈的方法，先把（{【放入栈，后面的入栈时若有相匹配的就出栈。最后为空则为true。



]]></description><category></category></item><item><title><![CDATA[环形链表]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/104818908</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/104818908</guid><author>wdnmdpy</author><pubDate>Thu, 12 Mar 2020 14:46:19 +0800</pubDate><description><![CDATA[双指针法


]]></description><category></category></item><item><title><![CDATA[删除排序链表中的重复元素]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/104817598</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/104817598</guid><author>wdnmdpy</author><pubDate>Thu, 12 Mar 2020 13:56:02 +0800</pubDate><description><![CDATA[删除排序链表中的重复元素
双指针法

]]></description><category></category></item><item><title><![CDATA[合并两个有序链表]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/104817312</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/104817312</guid><author>wdnmdpy</author><pubDate>Thu, 12 Mar 2020 13:41:04 +0800</pubDate><description><![CDATA[合并两个有序链表
递归方法
class Solution {
public:    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) 
{        
if(l1==nullptr)        
return l2;        
if(l2==nullptr)       
 return l1;        
 if(l1-&g...]]></description><category></category></item><item><title><![CDATA[猜数游戏]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/104658069</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/104658069</guid><author>wdnmdpy</author><pubDate>Wed, 04 Mar 2020 17:26:33 +0800</pubDate><description><![CDATA[题目：电脑产生一个0到100之间的随机数字，要求用户来猜，电脑会提示用户猜大了还是小了，如果输入的不是数字，电脑会提醒你输入无效。
#include&lt;iostream&gt;
using namespace std;
int main()
{
 int guess = rand() % 100 + 1;
 int m;
 for (int i = 1;i &lt; 101;i++)
 {
 ...]]></description><category></category></item><item><title><![CDATA[买股票最佳时期]]></title><link>https://blog.youkuaiyun.com/wdnmdpy/article/details/104584673</link><guid>https://blog.youkuaiyun.com/wdnmdpy/article/details/104584673</guid><author>wdnmdpy</author><pubDate>Sat, 29 Feb 2020 23:21:59 +0800</pubDate><description><![CDATA[买股票最佳时期
方法一：暴力法
class Solution {public:    int maxProfit(vector&lt;int&gt;&amp; prices) {   
int max=INT_MIN;       
 int sum=0;        
  int len=int(prices.size());        
   if(len&lt;2)          ...]]></description><category></category></item></channel></rss>