<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[踏实 谦虚 卓越]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/longfu_2008</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; longfu_2008]]></copyright><item><title><![CDATA[【LeetCode】236. Lowest Common Ancestor of a Binary Tree]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/78014063</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/78014063</guid><author>longfu_2008</author><pubDate>Sun, 17 Sep 2017 22:09:59 +0800</pubDate><description><![CDATA[【题目】


Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between ]]></description><category></category></item><item><title><![CDATA[【LeetCode】165. Compare Version Numbers]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/78004973</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/78004973</guid><author>longfu_2008</author><pubDate>Sat, 16 Sep 2017 17:15:02 +0800</pubDate><description><![CDATA[【题目】


Compare two version numbers version1 and version2.
If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0.

You may assume that the version strings are non-em]]></description><category></category></item><item><title><![CDATA[【LeetCode】198. House Robber]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/78004526</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/78004526</guid><author>longfu_2008</author><pubDate>Sat, 16 Sep 2017 16:36:08 +0800</pubDate><description><![CDATA[【题目】


You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adja]]></description><category></category></item><item><title><![CDATA[【LeetCode】653. Two Sum IV - Input is a BST]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/77801639</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/77801639</guid><author>longfu_2008</author><pubDate>Sat, 02 Sep 2017 15:47:39 +0800</pubDate><description><![CDATA[【题目】


Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.
Example 1:

Input: 
    5
   / \
  3  ]]></description><category></category></item><item><title><![CDATA[【Leetcode】Min Stack]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/51142481</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/51142481</guid><author>longfu_2008</author><pubDate>Wed, 13 Apr 2016 13:34:46 +0800</pubDate><description><![CDATA[【题目】


Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top]]></description><category></category></item><item><title><![CDATA[程序员技术练级攻略]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/38046285</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/38046285</guid><author>longfu_2008</author><pubDate>Tue, 22 Jul 2014 17:33:15 +0800</pubDate><description><![CDATA[原文：

月光博客6月12日发表了《写给新手程序员的一封信》，翻译自《An open letter to those who
 want to start programming》，我的朋友（他在本站的id是Mailper）告诉我，他希望在酷壳上看到一篇更具操作性的文章。因为他也是喜欢编程和技术的家伙，于是，我让他把他的一些学习Python和Web编程的一些点滴总结一下。于是他给我发来了一些]]></description><category></category></item><item><title><![CDATA[写给新手程序员的一封信]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/38046231</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/38046231</guid><author>longfu_2008</author><pubDate>Tue, 22 Jul 2014 17:31:04 +0800</pubDate><description><![CDATA[首先，欢迎来到程序员的世界。在这个世界上，不是有很多人想创造软件并解决问题。你是一名hacker，属于那些愿意做一些有挑战性的事情的人。
　　“当你不创造东西时，你只会根据自己的感觉而不是能力去看待问题。” – WhyTheLuckyStiff
　　对于下面的文字你不必完全接受，所有这些来自一个其貌不扬的程序员。我喜欢把事情做到最好，而不是对原来的东西修修补补。
　　仅仅是因为爱好开始做一些]]></description><category></category></item><item><title><![CDATA[【Leetcode】Substring with Concatenation of All Words]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/37962915</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/37962915</guid><author>longfu_2008</author><pubDate>Sat, 19 Jul 2014 16:09:41 +0800</pubDate><description><![CDATA[【题目】


You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and ]]></description><category></category></item><item><title><![CDATA[【Leetcode】Add Binary]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/37784561</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/37784561</guid><author>longfu_2008</author><pubDate>Tue, 15 Jul 2014 01:22:44 +0800</pubDate><description><![CDATA[【题目】


Given two binary strings, return their sum (also a binary string).

For example,
a = "11"
b = "1"
Return "100".
【代码】
class Solution {
public:
    string addBinary(string a, string b) ]]></description><category></category></item><item><title><![CDATA[【Leetcode】3Sum Closest]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/37773455</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/37773455</guid><author>longfu_2008</author><pubDate>Mon, 14 Jul 2014 21:40:35 +0800</pubDate><description><![CDATA[【题目】


Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would ha]]></description><category></category></item><item><title><![CDATA[【Leetcode】Count and Say]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/37759083</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/37759083</guid><author>longfu_2008</author><pubDate>Mon, 14 Jul 2014 13:11:11 +0800</pubDate><description><![CDATA[【题目】


The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, 21, 1211, 111221, ...

1 is read off as "one
 1" or 11.
11 is read off as "two
 1s" or 21.
21 is re]]></description><category></category></item><item><title><![CDATA[【Leetcode】Word Break II]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/29363257</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/29363257</guid><author>longfu_2008</author><pubDate>Sun, 08 Jun 2014 13:49:50 +0800</pubDate><description><![CDATA[【题目】


Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.

Return all such possible sentences.

For example, gi]]></description><category></category></item><item><title><![CDATA[【Leetcode】Linked List Cycle]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/28126037</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/28126037</guid><author>longfu_2008</author><pubDate>Mon, 02 Jun 2014 19:37:47 +0800</pubDate><description><![CDATA[【题目】


Given a linked list, determine if it has a cycle in it.

Follow up:
Can you solve it without using extra space?
【代码】]]></description><category></category></item><item><title><![CDATA[【Leetcode】Sort List]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/28096219</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/28096219</guid><author>longfu_2008</author><pubDate>Mon, 02 Jun 2014 11:18:21 +0800</pubDate><description><![CDATA[【题目】
Sort a linked list in O(n log n)
 time using constant space complexity.

【代码】
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     Lis]]></description><category></category></item><item><title><![CDATA[【Leetcode】Insertion Sort List]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/28095711</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/28095711</guid><author>longfu_2008</author><pubDate>Mon, 02 Jun 2014 10:57:15 +0800</pubDate><description><![CDATA[【题目】
Sort a linked list using insertion sort.

【]]></description><category></category></item><item><title><![CDATA[【Leetcode】Reverse Integer]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/26150479</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/26150479</guid><author>longfu_2008</author><pubDate>Sun, 18 May 2014 15:17:50 +0800</pubDate><description><![CDATA[【题目】


【代码】
class Solution {
public:
    int reverse(int x) {
        int result=0;
    bool pos=true;
    if(x<0){
        pos=false;
        x=-x;
    }
    while(x){
        result=result*10+x%]]></description><category></category></item><item><title><![CDATA[【Leetcode】ZigZag Conversion]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/26148295</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/26148295</guid><author>longfu_2008</author><pubDate>Sun, 18 May 2014 14:49:34 +0800</pubDate><description><![CDATA[【题目】


The string "PAYPALISHIRING" is written in a zigzag pattern on a given
 number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
P   A   H   N
]]></description><category></category></item><item><title><![CDATA[【Leetcode】Longest Palindromic Substring]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/26140551</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/26140551</guid><author>longfu_2008</author><pubDate>Sun, 18 May 2014 12:21:05 +0800</pubDate><description><![CDATA[【题目】
Given a string S,
 find the longest palindromic substring in S.
 You may assume that the maximum length of S is
 1000, and there exists one unique longest palindromic substring.

【代码】]]></description><category></category></item><item><title><![CDATA[【Leetcode】Add Two Numbers]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/25723721</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/25723721</guid><author>longfu_2008</author><pubDate>Tue, 13 May 2014 17:00:21 +0800</pubDate><description><![CDATA[【题目】

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it a]]></description><category></category></item><item><title><![CDATA[leetcode难度及面试频率]]></title><link>https://blog.youkuaiyun.com/longfu_2008/article/details/24000475</link><guid>https://blog.youkuaiyun.com/longfu_2008/article/details/24000475</guid><author>longfu_2008</author><pubDate>Fri, 18 Apr 2014 10:43:55 +0800</pubDate><description><![CDATA[1

Two Sum

2

5

array

sort







 

 

 

 

set

Two Pointers







2

Add Two Numbers

3

4

linked list

Two Pointers







 

 

 
]]></description><category></category></item></channel></rss>