<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[kradnangel的专栏]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/kradnangel</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; kradnangel]]></copyright><item><title><![CDATA[[题解][LeetCode][Palindrome Number]]]></title><link>https://blog.csdn.net/kradnangel/article/details/38316121</link><guid>https://blog.csdn.net/kradnangel/article/details/38316121</guid><author>kradnangel</author><pubDate>Thu, 31 Jul 2014 14:03:46 +0800</pubDate><description><![CDATA[题目：






题解：






Code：]]></description><category></category></item><item><title><![CDATA[[题解][LeetCode][Valid Parentheses]]]></title><link>https://blog.csdn.net/kradnangel/article/details/38315395</link><guid>https://blog.csdn.net/kradnangel/article/details/38315395</guid><author>kradnangel</author><pubDate>Thu, 31 Jul 2014 12:50:27 +0800</pubDate><description><![CDATA[题目：


Given a string containing just the characters '(', ')', '{', '}', '[' and ']',
 determine if the input string is valid.

The brackets must close in the correct order, "()" and "()[]{}" are]]></description><category></category></item><item><title><![CDATA[[题解][LeetCode][Divide Two Integers]]]></title><link>https://blog.csdn.net/kradnangel/article/details/38302273</link><guid>https://blog.csdn.net/kradnangel/article/details/38302273</guid><author>kradnangel</author><pubDate>Wed, 30 Jul 2014 16:17:14 +0800</pubDate><description><![CDATA[题解：
位运算






Code：
class Solution:
    # @return an integer
    def divide(self, dividend, divisor):
        if divisor == 1:
        	return dividend
        if divisor == -1:
        	retu]]></description><category></category></item><item><title><![CDATA[[题解][LeetCode][Scramble String]]]></title><link>https://blog.csdn.net/kradnangel/article/details/38299545</link><guid>https://blog.csdn.net/kradnangel/article/details/38299545</guid><author>kradnangel</author><pubDate>Wed, 30 Jul 2014 14:47:57 +0800</pubDate><description><![CDATA[题目：


Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.

Below is one possible representation of s1 = "great":
    great
   /   ]]></description><category></category></item><item><title><![CDATA[[题解][LeetCode][Valid Palindrome]]]></title><link>https://blog.csdn.net/kradnangel/article/details/38281593</link><guid>https://blog.csdn.net/kradnangel/article/details/38281593</guid><author>kradnangel</author><pubDate>Tue, 29 Jul 2014 23:25:33 +0800</pubDate><description><![CDATA[Code:]]></description><category></category></item><item><title><![CDATA[[题解][LeetCode][Combinations]]]></title><link>https://blog.csdn.net/kradnangel/article/details/38239509</link><guid>https://blog.csdn.net/kradnangel/article/details/38239509</guid><author>kradnangel</author><pubDate>Tue, 29 Jul 2014 00:29:12 +0800</pubDate><description><![CDATA[题目：






题解：






Code:]]></description><category></category></item><item><title><![CDATA[[题解][LeetCode][Pascal's Triangle II]]]></title><link>https://blog.csdn.net/kradnangel/article/details/38238753</link><guid>https://blog.csdn.net/kradnangel/article/details/38238753</guid><author>kradnangel</author><pubDate>Mon, 28 Jul 2014 22:57:20 +0800</pubDate><description><![CDATA[题目：








题解：






Code：]]></description><category></category></item><item><title><![CDATA[[题解][LeetCode][Binary Tree Level Order Traversal]]]></title><link>https://blog.csdn.net/kradnangel/article/details/38048317</link><guid>https://blog.csdn.net/kradnangel/article/details/38048317</guid><author>kradnangel</author><pubDate>Tue, 22 Jul 2014 20:02:05 +0800</pubDate><description><![CDATA[题目：




题解：






Code:
class Solution:
	# @param root, a tree node
	# @return a list of lists of integers
	def levelOrder(self, root):
		ans = []
		if root is None:
			return ans
		a = []]></description><category></category></item><item><title><![CDATA[[题解][LeetCode][Sort Colors]]]></title><link>https://blog.csdn.net/kradnangel/article/details/38024665</link><guid>https://blog.csdn.net/kradnangel/article/details/38024665</guid><author>kradnangel</author><pubDate>Mon, 21 Jul 2014 21:52:59 +0800</pubDate><description><![CDATA[题目：


Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.

Here, we will use the ]]></description><category></category></item><item><title><![CDATA[[题解][LeetCode][Linked List Cycle II]]]></title><link>https://blog.csdn.net/kradnangel/article/details/37929759</link><guid>https://blog.csdn.net/kradnangel/article/details/37929759</guid><author>kradnangel</author><pubDate>Fri, 18 Jul 2014 14:58:39 +0800</pubDate><description><![CDATA[题目：


Given a linked list, return the node where the cycle begins. If there is no cycle, return null.

Follow up:
Can you solve it without using extra space?
题解1：]]></description><category></category></item><item><title><![CDATA[[题解][LeetCode][Single Number II]]]></title><link>https://blog.csdn.net/kradnangel/article/details/37878745</link><guid>https://blog.csdn.net/kradnangel/article/details/37878745</guid><author>kradnangel</author><pubDate>Wed, 16 Jul 2014 16:53:06 +0800</pubDate><description><![CDATA[题目：






题解：










Code:
class Solution:
    # @param A, a list of integer
    # @return an integer
    def singleNumber(self, A):
        d = {'0' : 0}
        for i in A:
   ]]></description><category></category></item><item><title><![CDATA[[题解][LeetCode][Linked List Cycle]]]></title><link>https://blog.csdn.net/kradnangel/article/details/37817551</link><guid>https://blog.csdn.net/kradnangel/article/details/37817551</guid><author>kradnangel</author><pubDate>Tue, 15 Jul 2014 15:45:38 +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][Unique Binary Search Trees]]]></title><link>https://blog.csdn.net/kradnangel/article/details/37813777</link><guid>https://blog.csdn.net/kradnangel/article/details/37813777</guid><author>kradnangel</author><pubDate>Tue, 15 Jul 2014 14:36:24 +0800</pubDate><description><![CDATA[题目：


Given n, how many structurally unique BST's (binary search trees) that store values 1...n?

For example,
Given n = 3, there are a total of 5 unique BST's.
1         3     3      2      1
]]></description><category></category></item><item><title><![CDATA[[数据挖掘][序言]]]></title><link>https://blog.csdn.net/kradnangel/article/details/34575515</link><guid>https://blog.csdn.net/kradnangel/article/details/34575515</guid><author>kradnangel</author><pubDate>Thu, 26 Jun 2014 00:34:27 +0800</pubDate><description><![CDATA[数据挖掘
1. 存在的价值（lie]]></description><category></category></item><item><title><![CDATA[[Matlab][数据挖掘算法][线性回归]]]></title><link>https://blog.csdn.net/kradnangel/article/details/27852579</link><guid>https://blog.csdn.net/kradnangel/article/details/27852579</guid><author>kradnangel</author><pubDate>Sat, 31 May 2014 21:01:07 +0800</pubDate><description><![CDATA[x0 = linspace(1,1,size(X,2));   %x0 is all 1
    X = [x0; X];
    w = inv(X * X') * X * y';]]></description><category></category></item><item><title><![CDATA[[Matlab][数据挖掘算法][感知机]]]></title><link>https://blog.csdn.net/kradnangel/article/details/27847803</link><guid>https://blog.csdn.net/kradnangel/article/details/27847803</guid><author>kradnangel</author><pubDate>Sat, 31 May 2014 20:46:19 +0800</pubDate><description><![CDATA[Perceptron









    X = [linspace(1,1,size(X,2)) ; X];  % add x0 % p = p + 1
    P = size(X,1);
    N = size(X,2);
    k = 0;  flag = 0;  iter = 0;
    w = rand(P, 1);
    while (1)
    ]]></description><category></category></item><item><title><![CDATA[[C/C++][Log]]]></title><link>https://blog.csdn.net/kradnangel/article/details/26858611</link><guid>https://blog.csdn.net/kradnangel/article/details/26858611</guid><author>kradnangel</author><pubDate>Sat, 24 May 2014 19:04:05 +0800</pubDate><description><![CDATA[1. extern
       extern可以置于变量或者函数前，以表示变量或者函数的定义在别的文件中，提示编译器遇到此变量和函数时在其他模块中寻找其定义


extern int a;//声明一个全局变量a

int a; //定义一个全局变量a

extern int a =0 ;//定义一个全局变量a 并给初值。一旦给予赋值，一定是定义，定义才会分配存储空间。

in]]></description><category></category></item><item><title><![CDATA[[pcDuino][刷机]]]></title><link>https://blog.csdn.net/kradnangel/article/details/26138427</link><guid>https://blog.csdn.net/kradnangel/article/details/26138427</guid><author>kradnangel</author><pubDate>Sun, 18 May 2014 11:30:19 +0800</pubDate><description><![CDATA[在玩 pcDuino 的过程中,总免不了要刷机。
所以我将pcDuin]]></description><category></category></item><item><title><![CDATA[[题解] 神奇的数列 -- 编程之美初赛第二场第一题]]></title><link>https://blog.csdn.net/kradnangel/article/details/24196345</link><guid>https://blog.csdn.net/kradnangel/article/details/24196345</guid><author>kradnangel</author><pubDate>Sun, 20 Apr 2014 21:08:59 +0800</pubDate><description><![CDATA[看到题目之后，首先想到的是，是不是所有数字其实都可以只用A]]></description><category></category></item><item><title><![CDATA[Java——复习]]></title><link>https://blog.csdn.net/kradnangel/article/details/24137639</link><guid>https://blog.csdn.net/kradnangel/article/details/24137639</guid><author>kradnangel</author><pubDate>Sat, 19 Apr 2014 21:25:34 +0800</pubDate><description><![CDATA[1. Java math库的使用]]></description><category></category></item></channel></rss>