<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[xyprojectd的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/xyprojectd</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; xyprojectd]]></copyright><item><title><![CDATA[笛卡尔树构建]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39501193</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39501193</guid><author>xyprojectd</author><pubDate>Tue, 23 Sep 2014 17:24:07 +0800</pubDate><description><![CDATA[//
//  main.cpp
//  数列构建笛卡尔树
//

#include 
using namespace std;

/*
                  35
                 /  \
               16    27
              / \   /  \
            12  15 19  18
 
         12 ]]></description><category></category></item><item><title><![CDATA[LeetCode-Triangle]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39481181</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39481181</guid><author>xyprojectd</author><pubDate>Mon, 22 Sep 2014 20:13:31 +0800</pubDate><description><![CDATA[int minimumTotal(vector > &triangle)
{
    int n=triangle.size();
    
    for(int layer=n-2; layer>=0; --layer)
    {
        for(int i=0; i<=layer; ++i)
        {
            triangle[layer][i] = mi]]></description><category></category></item><item><title><![CDATA[LeetCode-Path Sum II]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39450347</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39450347</guid><author>xyprojectd</author><pubDate>Sun, 21 Sep 2014 11:55:27 +0800</pubDate><description><![CDATA[class Solution {
public:
    

vector > pathSum(TreeNode *root, int sum)
{
    vector >vec;
    vector path;
    if(root==NULL)
        return vec;
    FindPathSum(root, sum, 0, vec, path);
    return]]></description><category></category></item><item><title><![CDATA[LeetCode-3Sum Closest]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39435351</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39435351</guid><author>xyprojectd</author><pubDate>Sat, 20 Sep 2014 21:25:18 +0800</pubDate><description><![CDATA[class Solution {
public:
    int threeSumClosest(vector &num, int target)
{
    int result=0;
    int Min=INT_MAX;
    
    sort(num.begin(), num.end());
    vector::iterator iter=num.begin();
    for]]></description><category></category></item><item><title><![CDATA[LeetCode-Valid Sudoku]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39315093</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39315093</guid><author>xyprojectd</author><pubDate>Tue, 16 Sep 2014 11:45:16 +0800</pubDate><description><![CDATA[class Solution {
public:
    
    bool isValidSudoku(vector > &board)
    {
        bool used[9];
        
        for(int i=0; i<9; ++i)
        {
            fill(used, used+9, false);
            
]]></description><category></category></item><item><title><![CDATA[LeetCode-Search in Rotated Sorted Array]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39259293</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39259293</guid><author>xyprojectd</author><pubDate>Sun, 14 Sep 2014 00:17:18 +0800</pubDate><description><![CDATA[int search(int A[], int n, int target)
{
    if(A==0 || n==0)
        return -1;
    
    int left = 0;
    int right = n-1;
    
    while(left<=right)
    {
        int mid =left+((right-left)>>1);
]]></description><category></category></item><item><title><![CDATA[LeetCode-Palindrome Number]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39227209</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39227209</guid><author>xyprojectd</author><pubDate>Fri, 12 Sep 2014 10:59:52 +0800</pubDate><description><![CDATA[bool isPalindrome(int x)
{
    if(x<0)
        return false;
    if(0<=x && x<=9)
        return true;
    
    long long m=x,temp=0;
    while(m!=0)
    {
        temp=temp*10+m%10;
        m/=10;
  ]]></description><category></category></item><item><title><![CDATA[LeetCode-Length of Last Word]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39226981</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39226981</guid><author>xyprojectd</author><pubDate>Fri, 12 Sep 2014 10:46:24 +0800</pubDate><description><![CDATA[int lengthOfLastWord(const char *s)
{
    if(s==NULL)
        return 0;
    
    int length=0;
    int temp=0;
    for(int i=0; s[i]!='\0'; ++i)
    {
        if(s[i]==' ')
        {
            if(le]]></description><category></category></item><item><title><![CDATA[LeetCode-Minimum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39226589</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39226589</guid><author>xyprojectd</author><pubDate>Fri, 12 Sep 2014 10:23:38 +0800</pubDate><description><![CDATA[int depth(TreeNode *root, int sum)
{

    if(root->left==NULL && root->right==NULL)
        return sum;
    
    if(root->left==NULL)
        return depth(root->right,sum+1);
    if(root->right==NULL)]]></description><category></category></item><item><title><![CDATA[LeetCode-Remove Nth Node From End of List]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39215479</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39215479</guid><author>xyprojectd</author><pubDate>Fri, 12 Sep 2014 00:07:00 +0800</pubDate><description><![CDATA[ListNode *removeNthFromEnd(ListNode *head, int n)
{
    if(head==NULL || (head->next==NULL && n==1))
        return NULL;

    
    ListNode *pNode = head;
    int length=0;
    
    while(pNode!=NULL]]></description><category></category></item><item><title><![CDATA[LeetCode-Combinations]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39178081</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39178081</guid><author>xyprojectd</author><pubDate>Wed, 10 Sep 2014 10:25:34 +0800</pubDate><description><![CDATA[void comb(int n, int index, int k, vector > &res, vector &temp)
{
    if(temp.size()==k)
        res.push_back(temp);
    
    for(int i=index; i<=n; ++i)
    {
        temp.push_back(i);
        comb]]></description><category></category></item><item><title><![CDATA[PYTHON 自然语言处理]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39162357</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39162357</guid><author>xyprojectd</author><pubDate>Tue, 09 Sep 2014 22:26:06 +0800</pubDate><description><![CDATA[开始阅读这本自然语言处理的书，恰好最近也学了学python，jian'jian]]></description><category></category></item><item><title><![CDATA[LeetCode-Path Sum]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39143691</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39143691</guid><author>xyprojectd</author><pubDate>Tue, 09 Sep 2014 00:25:58 +0800</pubDate><description><![CDATA[/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Soluti]]></description><category></category></item><item><title><![CDATA[位图法]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/39141375</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/39141375</guid><author>xyprojectd</author><pubDate>Mon, 08 Sep 2014 23:17:54 +0800</pubDate><description><![CDATA[此文章转自 快课网]]></description><category></category></item><item><title><![CDATA[LeetCode-Remove Duplicates from Sorted Array II]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/28753049</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/28753049</guid><author>xyprojectd</author><pubDate>Fri, 06 Jun 2014 00:28:59 +0800</pubDate><description><![CDATA[class Solution {
public:
    int Duplicate(int i,int A[])
{
    int count=1;
    for(int j=i+1;A[i]==A[j];j++)
    {
        count++;
    }
    return count;
}

int removeDuplicates(int A[], int n)
{
]]></description><category></category></item><item><title><![CDATA[LeetCode-Merge Two Sorted Lists]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/24309159</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/24309159</guid><author>xyprojectd</author><pubDate>Tue, 22 Apr 2014 14:59:18 +0800</pubDate><description><![CDATA[/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *me]]></description><category></category></item><item><title><![CDATA[LeetCode-Linked List Cycle]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/24308977</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/24308977</guid><author>xyprojectd</author><pubDate>Tue, 22 Apr 2014 14:55:27 +0800</pubDate><description><![CDATA[/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    bool hasCycl]]></description><category></category></item><item><title><![CDATA[LeetCode-Search Insert Position]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/24308819</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/24308819</guid><author>xyprojectd</author><pubDate>Tue, 22 Apr 2014 14:52:29 +0800</pubDate><description><![CDATA[class Solution {//简单的二分搜索变形
public:
    int searchInsert(int A[], int n, int target) 
    {
        int low=0;
    int high=n-1;
    int mid;
    
    while(low<=high)
    {
        mid=low+((high-low]]></description><category></category></item><item><title><![CDATA[LeetCode-Sort Colors]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/24308599</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/24308599</guid><author>xyprojectd</author><pubDate>Tue, 22 Apr 2014 14:49:42 +0800</pubDate><description><![CDATA[class Solution {
public:
    void sortColors(int Array[], int length) {
        if(Array==NULL||length<=0)
        return ;
    
    int current;
    int begin;
    int end;
    
    current=begin=0;
]]></description><category></category></item><item><title><![CDATA[LeetCode-N-Queens II]]></title><link>https://blog.youkuaiyun.com/xyprojectd/article/details/24308425</link><guid>https://blog.youkuaiyun.com/xyprojectd/article/details/24308425</guid><author>xyprojectd</author><pubDate>Tue, 22 Apr 2014 14:47:16 +0800</pubDate><description><![CDATA[class Solution {
public:
    int tot;
int c[100];
void search(int cur,int n)//cur代表着行，i代表着列
{
    int i,j;
    int ok;
    if(cur==n)
        tot++;
    else
    {
        for(i=0;i<n;i++)
        {
 ]]></description><category></category></item></channel></rss>