<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[u010283113的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u010283113</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u010283113]]></copyright><item><title><![CDATA[【HOT 100】LeetCode+题解 +GO 代码+复杂度分析+最全默写笔记，狠狠滴刷]]></title><link>https://blog.youkuaiyun.com/u010283113/article/details/146053786</link><guid>https://blog.youkuaiyun.com/u010283113/article/details/146053786</guid><author>u010283113</author><pubDate>Wed, 05 Mar 2025 21:43:46 +0800</pubDate><description><![CDATA[难题汇总
A.1.1. 两数之和


3.min字符串排序与合并，最后收集，maps.:Values()

3.min先生成是否存在的map，然后便利map

4.min

A.5.11. 盛最多水的容器


C.6.15. 三数之和*
错了好多遍了，后面两个指针的移动规律要搞清楚，先移动第三个，还要确定没有重复的

A.7.42. 接雨水


A.8.3. 无重复字符的最长子串
双指针

A.9.438. 找到字符串中所有字母异位词
使用数组来判定真是天才

B.10.560. 和为 K 的子数组
前缀和]]></description><category></category></item><item><title><![CDATA[4. 丑数 II]]></title><link>https://blog.youkuaiyun.com/u010283113/article/details/81278504</link><guid>https://blog.youkuaiyun.com/u010283113/article/details/81278504</guid><author>u010283113</author><pubDate>Mon, 30 Jul 2018 05:05:30 +0800</pubDate><description><![CDATA[
class Solution:
    &quot;&quot;&quot;
    @param n: An integer
    @return: the nth prime number as description.
    &quot;&quot;&quot;
    def nthUglyNumber(self, n):
        # write your code here
        def un(a,b,c):
      ...]]></description><category></category></item><item><title><![CDATA[lintcode 165. 合并两个排序链表]]></title><link>https://blog.youkuaiyun.com/u010283113/article/details/79178040</link><guid>https://blog.youkuaiyun.com/u010283113/article/details/79178040</guid><author>u010283113</author><pubDate>Sat, 27 Jan 2018 02:27:43 +0800</pubDate><description><![CDATA[还是C++
/**
 * Definition of ListNode
 * class ListNode {
 * public:
 *     int val;
 *     ListNode *next;
 *     ListNode(int val) {
 *         this->val = val;
 *         this->next = NULL;
 *     }]]></description><category></category></item><item><title><![CDATA[lintcode 35. 翻转链表]]></title><link>https://blog.youkuaiyun.com/u010283113/article/details/79178033</link><guid>https://blog.youkuaiyun.com/u010283113/article/details/79178033</guid><author>u010283113</author><pubDate>Sat, 27 Jan 2018 02:19:00 +0800</pubDate><description><![CDATA[我C都没学会，直接统一用C++，坑苦我了
算了，归根结底 都是自己太弱的锅，

/**
 * Definition of ListNode
 * 
 * class ListNode {
 * public:
 *     int val;
 *     ListNode *next;
 * 
 *     ListNode(int val) {
 *         this->val =]]></description><category></category></item><item><title><![CDATA[lintcode 111. 爬楼梯  排列组合方法]]></title><link>https://blog.youkuaiyun.com/u010283113/article/details/79168243</link><guid>https://blog.youkuaiyun.com/u010283113/article/details/79168243</guid><author>u010283113</author><pubDate>Fri, 26 Jan 2018 04:52:46 +0800</pubDate><description><![CDATA[问题描述：

 假设你正在爬楼梯，需要n步你才能到达顶部。但每次你只能爬一步或者两步，你能有多少种不同的方法爬到楼顶部？

问题目前解法 其实 是斐波那契数列 ，因为一次只能走1步或2步，第n 阶楼梯，是从n-1或n-2那一阶梯上来的，方法数也
就是两者之和，通项 A(n)=A(n-1)+A(n-2)
但是
在下第一次见到这个题时能力太低，难免会对他的解法..... 没这么高端 
]]></description><category></category></item><item><title><![CDATA[lintcode 54. 转换字符串到整数]]></title><link>https://blog.youkuaiyun.com/u010283113/article/details/79163056</link><guid>https://blog.youkuaiyun.com/u010283113/article/details/79163056</guid><author>u010283113</author><pubDate>Thu, 25 Jan 2018 16:01:31 +0800</pubDate><description><![CDATA[class Solution:
    """
    @param: str: A string
    @return: An integer
    """
    def atoi(self, str):
        # write your code here              #*********python2************
        flag=0
    ]]></description><category></category></item></channel></rss>