<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Detective_Xin的专栏]]></title><description><![CDATA[分布式计算，海量数据处理，算法与数据结构]]></description><link>https://blog.youkuaiyun.com/Detective_Xin</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Detective_Xin]]></copyright><item><title><![CDATA[LeetCode Sum Root to Leaf Numbers]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/38016095</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/38016095</guid><author>Detective_Xin</author><pubDate>Mon, 21 Jul 2014 14:19:07 +0800</pubDate><description><![CDATA[Given a binary tree containing digits from 0-9 only, each root-to-leaf
 path could represent a number.

An example is the root-to-leaf path 1->2->3 which represents the number 123.

Find the tota]]></description><category></category></item><item><title><![CDATA[LeetCode Palindrome Partitioning]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/38016057</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/38016057</guid><author>Detective_Xin</author><pubDate>Mon, 21 Jul 2014 14:16:51 +0800</pubDate><description><![CDATA[Given a string s, partition s such that every substring of the partition is a palindrome.

Return all possible palindrome partitioning of s.

For example, given s = "aab",

Return

[
    ["aa"]]></description><category></category></item><item><title><![CDATA[LeetCode Combinations]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/38016001</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/38016001</guid><author>Detective_Xin</author><pubDate>Mon, 21 Jul 2014 14:14:21 +0800</pubDate><description><![CDATA[Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.

For example,
If n = 4 and k = 2, a solution is:
[
  [2,4],
  [3,4],
  [2,3],
  [1,2],
  [1,3],
  [1,4],
]]]></description><category></category></item><item><title><![CDATA[LeetCode Single Number]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/38013113</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/38013113</guid><author>Detective_Xin</author><pubDate>Mon, 21 Jul 2014 11:09:48 +0800</pubDate><description><![CDATA[Given an array of integers, every element appears twice except for one. Find that single one.

Note:

Your algorithm should have a linear runtime complexity. Could you implement it without using e]]></description><category></category></item><item><title><![CDATA[LeetCode Same Tree]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/38013003</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/38013003</guid><author>Detective_Xin</author><pubDate>Mon, 21 Jul 2014 11:02:49 +0800</pubDate><description><![CDATA[Given two binary trees, write a function to check if they are equal or not.


Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
判断]]></description><category></category></item><item><title><![CDATA[LeetCode Sort List]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/38012423</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/38012423</guid><author>Detective_Xin</author><pubDate>Mon, 21 Jul 2014 10:47:03 +0800</pubDate><description><![CDATA[Sort a linked list in O(n log n)
 time using constant space complexity.
对链表进行排序，要求时间复杂度为]]></description><category></category></item><item><title><![CDATA[LeetCode Convert Sorted List to Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/38012323</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/38012323</guid><author>Detective_Xin</author><pubDate>Mon, 21 Jul 2014 10:40:04 +0800</pubDate><description><![CDATA[Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
把有序链表转换为]]></description><category></category></item><item><title><![CDATA[LeetCode Linked List Cycle II]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/38012153</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/38012153</guid><author>Detective_Xin</author><pubDate>Mon, 21 Jul 2014 10:38:00 +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?]]></description><category></category></item><item><title><![CDATA[uva 270 Lining Up]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/16946339</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/16946339</guid><author>Detective_Xin</author><pubDate>Mon, 25 Nov 2013 16:24:58 +0800</pubDate><description><![CDATA[给出一系列二位坐标上的点，统计最多有多少个点在同一条直线上，暴力枚举n^3
#include 
#include 
struct Line {
	int no_slope;
	double k;
	double i_x;
	double i_y; //b
};
struct Point {
	double x;
	double y;
};
const double E = 1e-6;
bool]]></description><category></category></item><item><title><![CDATA[uva 231 Testing the CATCHER]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/16946307</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/16946307</guid><author>Detective_Xin</author><pubDate>Mon, 25 Nov 2013 16:22:33 +0800</pubDate><description><![CDATA[题目很长，其实就是个最长单调子序列的问题。
#include 
int data[1000];
int dp[1000];
int get_max(int a, int b) {
	if (a>b)
		return a;
	else
		return b;
}
int main() {
	int n;
	int i,j,tmp;
	int case_ctr=0;
	int flag=0;
	w]]></description><category></category></item><item><title><![CDATA[uva 190 Circle Through Three Points]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/16946275</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/16946275</guid><author>Detective_Xin</author><pubDate>Mon, 25 Nov 2013 16:20:58 +0800</pubDate><description><![CDATA[计算几何的题目，三点确定一个圆。
#include 
#include 
struct Line {
	int no_slope;
	double k;
	double i_x;
	double i_y;
};
struct Point {
	double x;
	double y;
};
const double E = 1e-5;
bool double_cmp(double a, doub]]></description><category></category></item><item><title><![CDATA[uva 147 Dollars]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/16945177</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/16945177</guid><author>Detective_Xin</author><pubDate>Mon, 25 Nov 2013 15:31:22 +0800</pubDate><description><![CDATA[完全背包问题，输出为方案总数。
#include 
#include 
const int SIZE=11;
int items[SIZE]={2000,1000,400,200,100,40,20,10,4,2,1};
int total = 6010;
long long dp[6010];
int main() {
    double m;
    int i,j;
    memset]]></description><category></category></item><item><title><![CDATA[uva 122  Trees on the level]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882893</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882893</guid><author>Detective_Xin</author><pubDate>Fri, 22 Nov 2013 13:19:27 +0800</pubDate><description><![CDATA[题目要求按层次输出数的各个节点，其实只要对输入的数据做个排序就可以了。
#include 
using namespace std;
#include 
#include 
#include 
struct Node {
	string v;
	string path;
};
Node nodes[300];
set v_set;
set p_set;
int get_(string s) {
]]></description><category></category></item><item><title><![CDATA[uva 120 Stacks of Flapjacks]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882857</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882857</guid><author>Detective_Xin</author><pubDate>Fri, 22 Nov 2013 13:17:25 +0800</pubDate><description><![CDATA[模拟题
#include 
#include 
#include 
using namespace std;
int ori[40];
int sorted[40];
int data[40];
int n;
vector result;
bool is_sorted() {
	int i;
	for (i=0;i<n-1;i++) {
		if (data[i]>data[i+1])
			r]]></description><category></category></item><item><title><![CDATA[UVA 111 History Grading]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882817</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882817</guid><author>Detective_Xin</author><pubDate>Fri, 22 Nov 2013 13:14:40 +0800</pubDate><description><![CDATA[最长公共子序列
#include 
#include 
int correct[30];
int stu[30];
int dp[30][30]; 
int get_max(int a, int b) {
	if (a>b)
		return a;
	else
		return b;
}
int main() {
	int n,i,j;
	int tmp;
	scanf("%d",&n);]]></description><category></category></item><item><title><![CDATA[UVA 108 Maximum Sum]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882773</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882773</guid><author>Detective_Xin</author><pubDate>Fri, 22 Nov 2013 13:12:58 +0800</pubDate><description><![CDATA[最大子矩阵和，转化为一维最大字串和解决
#include 
#include 
int n;
int data[120][120];
int column_sum[120];
int max_sum[120];
void set_column_sum(int r1, int r2) {
    memset(column_sum,0,sizeof(column_sum));
    int i,]]></description><category></category></item><item><title><![CDATA[UVA 103 Stacking Boxes]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882645</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882645</guid><author>Detective_Xin</author><pubDate>Fri, 22 Nov 2013 13:07:02 +0800</pubDate><description><![CDATA[记忆化搜索
#include 
#include 
#include 
#include 
using namespace std;
struct Box {
	int index;
	vector dimensions;
}; 
// 判断b2是否可以包含b1 
bool cmp(const Box& b1, const Box& b2) {
	int i;
	for (i=0;i<b1.di]]></description><category></category></item><item><title><![CDATA[UVA 101 The Blocks Problem]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882611</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882611</guid><author>Detective_Xin</author><pubDate>Fri, 22 Nov 2013 13:05:21 +0800</pubDate><description><![CDATA[直接模拟四个操作
#include 
using namespace std;
#include 
#include 
vector data[30];
int n;
void move_onto(int a, int b) {
	int row_a, row_b;
	int i, j;
	if (a==b)
		return;
	for (i=0;i<n;i++) {
		for (j=0;j]]></description><category></category></item><item><title><![CDATA[URAL 1022 Genealogical Tree]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882587</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882587</guid><author>Detective_Xin</author><pubDate>Fri, 22 Nov 2013 13:04:06 +0800</pubDate><description><![CDATA[拓扑排序
#include 
using namespace std;
#include 
#include 
int n;
int topology[120][120];
vector result;
bool zoro_out_degree(int index) {
//	bool flag = true;
	for (int i = 1;i <= n; i++) {
		if (topol]]></description><category></category></item><item><title><![CDATA[URAL 1014 Product of Digits]]></title><link>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882541</link><guid>https://blog.youkuaiyun.com/Detective_Xin/article/details/16882541</guid><author>Detective_Xin</author><pubDate>Fri, 22 Nov 2013 13:02:29 +0800</pubDate><description><![CDATA[给定一个整数N，找出最小的正整数Q，使得Q的各位数的积等于N。
直接深搜
#include 
using namespace std;
#include 
#include 
int flag;
vector result;
void dfs(int num) {
	if (flag==1)
		return;
	if (num < 10) {
		result.push_back(num);]]></description><category></category></item></channel></rss>