<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Howie66的博客]]></title><description><![CDATA[To be a life-long learner!]]></description><link>https://blog.youkuaiyun.com/Neo233</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Neo233]]></copyright><item><title><![CDATA[顺序表应用8：最大子段和之动态规划法]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/86660940</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/86660940</guid><author>Neo233</author><pubDate>Sat, 26 Jan 2019 20:51:59 +0800</pubDate><description><![CDATA[Problem Description

 给定n(1&amp;lt;=n&amp;lt;=100000)个整数（可能为负数）组成的序列a[1],a[2],a[3],…,a[n],求该序列如a[i]+a[i+1]+…+a[j]的子段和的最大值。当所给的整数均为负数时定义子段和为0，依此定义，所求的最优值为： Max{0,a[i]+a[i+1]+…+a[j]},1&amp;lt;=i&amp;lt;=j&amp;lt;=n。 例如，当（a...]]></description><category></category></item><item><title><![CDATA[顺序表应用3：元素位置互换之移位算法]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/86641850</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/86641850</guid><author>Neo233</author><pubDate>Fri, 25 Jan 2019 11:36:41 +0800</pubDate><description><![CDATA[Problem Description

一个长度为len(1&amp;lt;=len&amp;lt;=1000000)的顺序表，数据元素的类型为整型，将该表分成两半，前一半有m个元素，后一半有len-m个元素（1&amp;lt;=m&amp;lt;=len)，借助元素移位的方式，设计一个空间复杂度为O(1)的算法，改变原来的顺序表，把顺序表中原来在前的m个元素放到表的后段，后len-m个元素放到表的前段。
注意：先将顺序表元素...]]></description><category></category></item><item><title><![CDATA[顺序表应用1：多余元素删除之移位算法]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/86635786</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/86635786</guid><author>Neo233</author><pubDate>Fri, 25 Jan 2019 09:36:23 +0800</pubDate><description><![CDATA[ 

Problem Description

一个长度不超过10000数据的顺序表，可能存在着一些值相同的“多余”数据元素（类型为整型），编写一个程序将“多余”的数据元素从顺序表中删除，使该表由一个“非纯表”（值相同的元素在表中可能有多个）变成一个“纯表”（值相同的元素在表中只保留第一个）。
要求：
       1、必须先定义线性表的结构与操作函数，在主函数中借助该定义与操作函数调用实现问题功...]]></description><category></category></item><item><title><![CDATA[Leetcode周赛119]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/86560885</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/86560885</guid><author>Neo233</author><pubDate>Sun, 20 Jan 2019 12:52:50 +0800</pubDate><description><![CDATA[已经累计打了10几场比赛了，之前忘记总结了，就从这一场开始总结吧。

本次比赛做出来2/4，前两个题，第三个题没想出思路，排名1700/3400，话说那些大佬真的是厉害，本次有400+大佬ak，强啊，最快的那个大佬在我刚做完第一题的时候就已经ak了，emmmmmm。

第一个：Squares of a Sorted Array（这个题相当简单，就是简单的做一个运算之后排个序就行了）

Given ...]]></description><category></category></item><item><title><![CDATA[Leetcode 967 Numbers With Same Consecutive Differences]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/85385417</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/85385417</guid><author>Neo233</author><pubDate>Sun, 30 Dec 2018 16:48:51 +0800</pubDate><description><![CDATA[Return all non-negative integers of length N such that the absolute difference between every two consecutive digits is K.

Note that every number in the answer must not have leading zeros except for t...]]></description><category></category></item><item><title><![CDATA[Leetcode 68  Text Justification]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/85220665</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/85220665</guid><author>Neo233</author><pubDate>Sun, 23 Dec 2018 10:26:49 +0800</pubDate><description><![CDATA[Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justified.

You should pack your words in a greedy appro...]]></description><category></category></item><item><title><![CDATA[Leetcode 71 Simplify Path]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/85220553</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/85220553</guid><author>Neo233</author><pubDate>Sun, 23 Dec 2018 10:01:01 +0800</pubDate><description><![CDATA[Given an absolute path for a file (Unix-style), simplify it. 

For example,path = &quot;/home/&quot;, =&amp;gt; &quot;/home&quot;path = &quot;/a/./b/../../c/&quot;, =&amp;gt; &quot;/c&quot;path = &quot;/a/../../b/../c//.//&quot;, =&amp;gt; &quot;/c&quot;pa]]></description><category></category></item><item><title><![CDATA[Leetcode 481 Magical String]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/85220482</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/85220482</guid><author>Neo233</author><pubDate>Sun, 23 Dec 2018 09:38:45 +0800</pubDate><description><![CDATA[A magical string S consists of only '1' and '2' and obeys the following rules:

The string S is magical because concatenating the number of contiguous occurrences of characters '1' and '2' generates t...]]></description><category></category></item><item><title><![CDATA[Leetcode 299 Bulls and Cows]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/85018887</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/85018887</guid><author>Neo233</author><pubDate>Sat, 15 Dec 2018 21:43:51 +0800</pubDate><description><![CDATA[题目：
You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint...]]></description><category></category></item><item><title><![CDATA[Leetcode 231 Power of Two]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/84937747</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/84937747</guid><author>Neo233</author><pubDate>Mon, 10 Dec 2018 12:15:25 +0800</pubDate><description><![CDATA[Given an integer, write a function to determine if it is a power of two.

Example 1:


Input: 1
Output: true 
Explanation: 20 = 1


Example 2:


Input: 16
Output: true
Explanation: 24 = 16

Example 3:...]]></description><category></category></item><item><title><![CDATA[Leetcode 42 Trapping Rain Water]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/84393249</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/84393249</guid><author>Neo233</author><pubDate>Fri, 23 Nov 2018 15:18:57 +0800</pubDate><description><![CDATA[Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.


The above elevation map is represented by array...]]></description><category></category></item><item><title><![CDATA[Leetcode 41 First Missing Positive]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/84259792</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/84259792</guid><author>Neo233</author><pubDate>Mon, 19 Nov 2018 20:47:55 +0800</pubDate><description><![CDATA[Given an unsorted integer array, find the smallest missing positive integer.

Example 1:


Input: [1,2,0]
Output: 3


Example 2:


Input: [3,4,-1,1]
Output: 2


Example 3:


Input: [7,8,9,11,12]
Outpu...]]></description><category></category></item><item><title><![CDATA[Leetcode 40 Combination Sum II]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/83988494</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/83988494</guid><author>Neo233</author><pubDate>Mon, 12 Nov 2018 10:58:33 +0800</pubDate><description><![CDATA[Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

Each number in candidates may...]]></description><category></category></item><item><title><![CDATA[Leetcode 39 Combination Sum]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/83988450</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/83988450</guid><author>Neo233</author><pubDate>Mon, 12 Nov 2018 10:54:58 +0800</pubDate><description><![CDATA[Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

The same repeat...]]></description><category></category></item><item><title><![CDATA[Leetcode 38 Count and Say]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/83894242</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/83894242</guid><author>Neo233</author><pubDate>Fri, 09 Nov 2018 10:51:35 +0800</pubDate><description><![CDATA[The count-and-say sequence is the sequence of integers with the first five terms as following:


1.     1
2.     11
3.     21
4.     1211
5.     111221


1 is read off as &quot;one 1&quot; or 11.11 is read off ...]]></description><category></category></item><item><title><![CDATA[Tomcat代码实现]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/83869164</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/83869164</guid><author>Neo233</author><pubDate>Thu, 08 Nov 2018 23:28:13 +0800</pubDate><description><![CDATA[最近开课学到了Tomcat，对这个挺感兴趣，就跟着网上的教程自己实现了一遍。
众所周知，Tomcat是一个满足Servlet规范的容器，在Java Web的项目中大量使用；一般来说，我们需要将Web应用打包成War文件部署到Tomcat服务器中，通过制定映射关系来制定路径，指明被哪个方法处理。Tomcat对于实际的请求会做出以下的操作：

提供Socket服务，不过是支持HTTP的Socket
进...]]></description><category></category></item><item><title><![CDATA[Leetcode 37 Sudoku Solver]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/83794249</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/83794249</guid><author>Neo233</author><pubDate>Tue, 06 Nov 2018 21:01:57 +0800</pubDate><description><![CDATA[Write a program to solve a Sudoku puzzle by filling the empty cells.

A sudoku solution must satisfy all of the following rules:

Each of the digits 1-9 must occur exactly once in each row.
	Each of t...]]></description><category></category></item><item><title><![CDATA[Leetcode 36 Valid Sudoku]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/83794214</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/83794214</guid><author>Neo233</author><pubDate>Tue, 06 Nov 2018 20:59:41 +0800</pubDate><description><![CDATA[Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

Each row must contain the digits 1-9 without repetition.
	Each column must conta...]]></description><category></category></item><item><title><![CDATA[Leetcode 935 Knight Dialer]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/83716350</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/83716350</guid><author>Neo233</author><pubDate>Sun, 04 Nov 2018 15:49:31 +0800</pubDate><description><![CDATA[A chess knight can move as indicated in the chess diagram below:

 .           

 

This time, we place our chess knight on any numbered key of a phone pad (indicated above), and the knight makes N-1 ...]]></description><category></category></item><item><title><![CDATA[Leetcode 933 Number of Recent Calls]]></title><link>https://blog.youkuaiyun.com/Neo233/article/details/83714506</link><guid>https://blog.youkuaiyun.com/Neo233/article/details/83714506</guid><author>Neo233</author><pubDate>Sun, 04 Nov 2018 11:54:36 +0800</pubDate><description><![CDATA[Write a class RecentCounter to count recent requests.

It has only one method: ping(int t), where t represents some time in milliseconds.

Return the number of pings that have been made from 3000 mill...]]></description><category></category></item></channel></rss>