<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[private_void的博客]]></title><description><![CDATA[记录一只渣的leetcode之路。代码有原创，有参考]]></description><link>https://blog.youkuaiyun.com/private_void</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; private_void]]></copyright><item><title><![CDATA[最长回文串问题]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46663581</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46663581</guid><author>private_void</author><pubDate>Thu, 11 Jul 2019 18:04:38 +0800</pubDate><description><![CDATA[题目：

Given a string S, find the longest palindromic substring in S.

给出一个字符串S，找到一个最长的连续回文串。

例如串babcbabcbaccba 最长回文是:abcbabcba

这个题目给出3中解法，前两种的都是 O(n^2)， 第三种思路是O(n).



思路1. 动态规划

这里动态规划的思路是 dp[i]...]]></description><category></category></item><item><title><![CDATA[java基础总结]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/88025521</link><guid>https://blog.youkuaiyun.com/private_void/article/details/88025521</guid><author>private_void</author><pubDate>Thu, 11 Jul 2019 17:59:59 +0800</pubDate><description><![CDATA[1 HashMap与HashTable

1）HashMap在实现时对null做了特殊处理，将null的hashCode值定为了0，从而将其存放在哈希表的第0个bucket中
	2）HashMap/HashTable内部用Entry数组实现哈希表;对于映射到同一个哈希桶（数组的同一个位置）的键值对，使用Entry链表来存储(解决hash冲突)
	3）HashTable默认的初始大小为11，之后每次...]]></description><category></category></item><item><title><![CDATA[Dijkstra算法]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46636675</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46636675</guid><author>private_void</author><pubDate>Thu, 25 Jun 2015 15:07:43 +0800</pubDate><description><![CDATA[原文地址：http://blog.youkuaiyun.com/stanfordzhang/article/details/6626584




1. Dijkstra's Algorithm是解决单源最短路径问题，即：从某个源点到其余各顶点的最短路径；

2. Dijkstra's Algorithm中有两上关键点要注意（这是我学习的时候不仔细，导致走了很多弯路）。这里先明确两个集合：所有顶]]></description><category></category></item><item><title><![CDATA[扔鸡蛋问题详解（Egg Dropping Puzzle）]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46636649</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46636649</guid><author>private_void</author><pubDate>Thu, 25 Jun 2015 15:06:05 +0800</pubDate><description><![CDATA[原文地址：http://blog.youkuaiyun.com/joylnwang/article/details/6769160


经典的动态规划问题，题设是这样的：
如果你有2颗鸡蛋，和一栋36层高的楼，现在你想知道在哪一层楼之下，鸡蛋不会被摔碎，应该如何用最少的测试次数对于任何答案楼层都能够使问题得到解决。


如果你从某一层楼扔下鸡蛋，它没有碎，则这个鸡蛋你可以继续用如果这个鸡蛋摔碎了]]></description><category></category></item><item><title><![CDATA[字符串匹配的KMP算法]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46636179</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46636179</guid><author>private_void</author><pubDate>Thu, 25 Jun 2015 14:33:04 +0800</pubDate><description><![CDATA[原文地址：http://www.ruanyifeng.com/blog/2013/05/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm.html
写的很好，转过来备查。


字符串匹配是计算机的基本任务之一。

举例来说，有一个字符串"BBC ABCDAB ABCDABCDABDE"，我想知道，里面是否包含另一个字符串"ABCDABD"？
]]></description><category></category></item><item><title><![CDATA[Java：类与继承]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46602685</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46602685</guid><author>private_void</author><pubDate>Tue, 23 Jun 2015 09:53:59 +0800</pubDate><description><![CDATA[原文地址：http://www.cnblogs.com/dolphin0520/p/3803432.html




Java：类与继承

　　对于面向对象的程序设计语言来说，类毫无疑问是其最重要的基础。抽象、封装、继承、多态这四大特性都离不开类，只有存在类，才能体现面向对象编程的特点，今天我们就来了解一些类与继承的相关知识。首先，我们讲述一下与类的初始化相关的东西，然后再从几个方面]]></description><category></category></item><item><title><![CDATA[#146 LRU Cache]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46455511</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46455511</guid><author>private_void</author><pubDate>Thu, 11 Jun 2015 11:36:52 +0800</pubDate><description><![CDATA[转自：http://www.cnblogs.com/springfor/p/3869393.html。写在开头，以示尊重。


题目：


Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get a]]></description><category></category></item><item><title><![CDATA[数据挖掘之聚类算法]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46363091</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46363091</guid><author>private_void</author><pubDate>Thu, 04 Jun 2015 16:01:42 +0800</pubDate><description><![CDATA[原文地址：http://www.blogjava.net/mlh123caoer/articles/51836.html

一， 什么是聚类？
聚类： - 将一个对象的集合分割成几个类，每个类内的对象之间是相似的，但与其他类的对象是不相似的。
评判聚类好坏的标准： 1 ，能够适用于大数据量。 2 ，能应付不同的数据类型。 3 ，能够发现不同类型的聚类。 4 ，使对专业知识的要求降到最低。 ]]></description><category></category></item><item><title><![CDATA[#110 Balanced Binary Tree]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46347263</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46347263</guid><author>private_void</author><pubDate>Wed, 03 Jun 2015 16:08:22 +0800</pubDate><description><![CDATA[题目：


Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node ne]]></description><category></category></item><item><title><![CDATA[#219 Contains Duplicate II]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46335299</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46335299</guid><author>private_void</author><pubDate>Tue, 02 Jun 2015 21:23:43 +0800</pubDate><description><![CDATA[题目：
Given an array of integers and an integer k,
 find out whether there there are two distinct indices i and j in
 the array such that nums[i] = nums[j] and
 the difference between i and j is
 a]]></description><category></category></item><item><title><![CDATA[#36 Valid Sudoku]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46334431</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46334431</guid><author>private_void</author><pubDate>Tue, 02 Jun 2015 20:12:28 +0800</pubDate><description><![CDATA[题目：


Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.

The Sudoku board could be partially filled, where empty cells are filled with the character '.'.




A partia]]></description><category></category></item><item><title><![CDATA[#101 Symmetric Tree]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46334299</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46334299</guid><author>private_void</author><pubDate>Tue, 02 Jun 2015 20:00:45 +0800</pubDate><description><![CDATA[题目：

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree is symmetric:
    1
   / \
  2   2
 / \ / \
3  4 4  3




Bu]]></description><category></category></item><item><title><![CDATA[#102 Binary Tree Level Order Traversal & #107 Binary Tree Level Order Traversal II]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46317815</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46317815</guid><author>private_void</author><pubDate>Mon, 01 Jun 2015 22:24:30 +0800</pubDate><description><![CDATA[题目：


Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:
Given binary tree {3,9,20,#,#,15,7},

    3
   / \
  9]]></description><category></category></item><item><title><![CDATA[#118 Pascal's Triangle  & #119 Pascal's Triangle II]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46291021</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46291021</guid><author>private_void</author><pubDate>Sun, 31 May 2015 19:43:07 +0800</pubDate><description><![CDATA[题目：


Given an index k, return the kth row of the Pascal's triangle.

For example, given k = 3,
Return [1,3,3,1].
题解：]]></description><category></category></item><item><title><![CDATA[#111 Minimum Depth of Binary Tree & #104 Maximum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46287559</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46287559</guid><author>private_void</author><pubDate>Sun, 31 May 2015 11:58:28 +0800</pubDate><description><![CDATA[题目：


Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.]]></description><category></category></item><item><title><![CDATA[#172 Factorial Trailing Zeroes]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46287335</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46287335</guid><author>private_void</author><pubDate>Sun, 31 May 2015 11:29:49 +0800</pubDate><description><![CDATA[题目：


Given an integer n, return the number of trailing zeroes in n!.

Note: Your solution should be in logarithmic time complexity.
题解：
看到一篇讲解非常好的文章，所以这题就转载吧。


对n!做质因数分解n!=2x*3y*5z*...]]></description><category></category></item><item><title><![CDATA[#160 Intersection of Two Linked Lists]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46228377</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46228377</guid><author>private_void</author><pubDate>Fri, 29 May 2015 11:34:57 +0800</pubDate><description><![CDATA[题目：


Write a program to find the node at which the intersection of two singly linked lists begins.


For example, the following two linked lists:
A:          a1 → a2
                   ↘]]></description><category></category></item><item><title><![CDATA[#21 Merge Two Sorted Lists]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46226387</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46226387</guid><author>private_void</author><pubDate>Fri, 29 May 2015 10:33:33 +0800</pubDate><description><![CDATA[题目：]]></description><category></category></item><item><title><![CDATA[#88 Merge Sorted Array]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46123749</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46123749</guid><author>private_void</author><pubDate>Thu, 28 May 2015 15:14:04 +0800</pubDate><description><![CDATA[题目：


Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to h]]></description><category></category></item><item><title><![CDATA[#168 Excel Sheet Column Title &&#171 Excel Sheet Column Number]]></title><link>https://blog.youkuaiyun.com/private_void/article/details/46049753</link><guid>https://blog.youkuaiyun.com/private_void/article/details/46049753</guid><author>private_void</author><pubDate>Wed, 27 May 2015 17:34:33 +0800</pubDate><description><![CDATA[#168
题目:


Given a positive integer, return its corresponding column title as appear in an Excel sheet.

For example:
    1 -> A
    2 -> B
    3 -> C
    ...
    26 -> Z
    27 -> AA
    28 ->]]></description><category></category></item></channel></rss>