<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Ragnaross的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Ragnaross</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Ragnaross]]></copyright><item><title><![CDATA[LeetCode习题笔记——Remove Duplicates from Sorted List II]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78994162</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78994162</guid><author>Ragnaross</author><pubDate>Sun, 07 Jan 2018 13:07:16 +0800</pubDate><description><![CDATA[Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

For example,
Given 1->2->3->3->4->4->5, return 1->2->5.

Given 1->]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——Remove Duplicates from Sorted List]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78994118</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78994118</guid><author>Ragnaross</author><pubDate>Sun, 07 Jan 2018 12:54:36 +0800</pubDate><description><![CDATA[Given a sorted linked list, delete all duplicates such that each element appear only once.

For example,
Given 1->1->2, return 1->2.

Given 1->1->2->3->3, return 1->2->3.
题目要求移除一个已经排列好的链表的重复成员，方]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——Length of Last Word]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78990572</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78990572</guid><author>Ragnaross</author><pubDate>Sat, 06 Jan 2018 18:01:22 +0800</pubDate><description><![CDATA[Given a string s consists of upper/lower-case alphabets and empty space characters '
 ', return the length of last word in the string.
If the last word does not exist, return 0.
Note: A word is def]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78984343</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78984343</guid><author>Ragnaross</author><pubDate>Fri, 05 Jan 2018 19:03:49 +0800</pubDate><description><![CDATA[Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [-2,1,-3,4,-1,2,1,-5,4],

the contiguous subarray [4,-1,2,1] ]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——Longest Substring Without Repeating Characters]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78954363</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78954363</guid><author>Ragnaross</author><pubDate>Tue, 02 Jan 2018 18:13:31 +0800</pubDate><description><![CDATA[Given a string, find the length of the longest substring without repeating characters.

Examples:

Given "abcabcbb", the answer is "abc",
 which the length is 3.

Given "bbbbb", the answer is "]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——Combination Sum II]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78954341</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78954341</guid><author>Ragnaross</author><pubDate>Tue, 02 Jan 2018 18:10:42 +0800</pubDate><description><![CDATA[Given a collection of candidate numbers (C) and a target number (T), find all unique combinations
 in C where the candidate numbers sums to T.
Each number in C may only be used once in the combinati]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——Rotate Image]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78954309</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78954309</guid><author>Ragnaross</author><pubDate>Tue, 02 Jan 2018 18:06:16 +0800</pubDate><description><![CDATA[You are given an n x n 2D matrix representing an image.

Rotate the image by 90 degrees (clockwise).

Note:
You have to rotate the image in-place, which means you have to modify the input 2D matr]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——Combination Sum]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78946495</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78946495</guid><author>Ragnaross</author><pubDate>Mon, 01 Jan 2018 18:08:26 +0800</pubDate><description><![CDATA[Given a set of candidate numbers (C) (without duplicates) and a target number
 (T), find all unique combinations in C where the candidate numbers sums to T.
The same repeated number may be chosen fr]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——Remove Nth Node From End of List]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78925556</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78925556</guid><author>Ragnaross</author><pubDate>Thu, 28 Dec 2017 19:30:08 +0800</pubDate><description><![CDATA[Given a linked list, remove the nth node from the end of list and return its head.

For example,
   Given linked list: 1->2->3->4->5, and n = 2.

   After removing the second node from the end, the]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——Longest Common Prefix]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78925535</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78925535</guid><author>Ragnaross</author><pubDate>Thu, 28 Dec 2017 19:26:32 +0800</pubDate><description><![CDATA[Write a function to find the longest common prefix string amongst an array of strings.
其实这个题目说的不是很清楚，有一个条件就是每个字符串都是包含这个前缀的，即不需要去考虑有可能会有两个完全不同的字符串，这也让这个题目简单许多：
class Solution {
public:
    string lon]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——水箱问题]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78925340</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78925340</guid><author>Ragnaross</author><pubDate>Thu, 28 Dec 2017 19:03:06 +0800</pubDate><description><![CDATA[Given n non-negative integers a1, a2,
 ..., an, where each represents a point at coordinate (i, ai). n vertical
 lines are drawn such that the two endpoints of line i is at (i, ai) and (i,
 0). Fin]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——判断数字是否回文]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78925284</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78925284</guid><author>Ragnaross</author><pubDate>Thu, 28 Dec 2017 18:53:11 +0800</pubDate><description><![CDATA[直接上题：




Determine whether an integer is a palindrome. Do this without extra space.
click to show spoilers.
Some hints:
Could negative integers be palindromes? (ie, -1)
If you are thinking o]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——罗马数字和整数之间的转换]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78633523</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78633523</guid><author>Ragnaross</author><pubDate>Sat, 25 Nov 2017 19:06:55 +0800</pubDate><description><![CDATA[今天看的是罗马数字和阿拉伯数字之间的转换，主要是字符串和数字之间的处理，话不多说，先来看整数到罗马数字：
题目描述：

Given an integer, convert it to a roman numeral.

Input is guaranteed to be within the range from 1 to 3999.

因为罗马数字有一个规定，即同一个字母不会出现超]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——Longest Palindromic Substring]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78379607</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78379607</guid><author>Ragnaross</author><pubDate>Sat, 28 Oct 2017 21:35:17 +0800</pubDate><description><![CDATA[这次的问题是判断一个字符串里最长的“回文串”，即一个串从左边到右边和右边到左边是一样（如"aba"）。下面是问题的具体描述：


Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is
 1000.
Example:
Inp]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——Add Two Numbers]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78236467</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78236467</guid><author>Ragnaross</author><pubDate>Sat, 14 Oct 2017 20:04:55 +0800</pubDate><description><![CDATA[这次问题看起来是两个数之和，其实主要考察两数相加中进位和对链表的一些基本操作，原题如下：


You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contai]]></description><category></category></item><item><title><![CDATA[LeetCode习题笔记——Two Sum]]></title><link>https://blog.youkuaiyun.com/Ragnaross/article/details/78101631</link><guid>https://blog.youkuaiyun.com/Ragnaross/article/details/78101631</guid><author>Ragnaross</author><pubDate>Tue, 26 Sep 2017 16:33:46 +0800</pubDate><description><![CDATA[Two Sum是LeetCode中最简单的例题之一，我们今天就从这个系列的题目开始练手，练习coding的算法以及算法的解析。
我们先从第一个题目开始看起：


Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You ma]]></description><category></category></item></channel></rss>