<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[zlasd的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/zlasd</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zlasd]]></copyright><item><title><![CDATA[MongoDB概览]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/70241871</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/70241871</guid><author>zlasd</author><pubDate>Wed, 19 Apr 2017 16:04:00 +0800</pubDate><description><![CDATA[简介MongoDB是首先是一种NoSQL(not only SQL)数据库，即非关系数据库。NoSQL有很多种，我们介绍的MongoDB属于文档数据库。 与传统的MySQL,Oracle等关系数据库比，MongoDB在分布式的大规模数据存储上有一定优势。本文介绍了MongoDB的一些基本用法，并在最后介绍其python的接口。]]></description><category></category></item><item><title><![CDATA[知识图谱中的知识表示学习（Representation Learning）]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/69258491</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/69258491</guid><author>zlasd</author><pubDate>Wed, 05 Apr 2017 15:47:39 +0800</pubDate><description><![CDATA[Word Representation1. one-hot representation
长度为词典长度，每个词在词典中的位置置1，其余置0
Curse of Dimension, 不适合太大的字典
互相正交，难以表示词语之间的相似性
2. distributed representation(词向量)
稠密、实值、低维的向量
便于Deep Learning
相似度用距离表示
word2vec
ki]]></description><category></category></item><item><title><![CDATA[支配集(dominating set)问题是NP完全问题的一个证明]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/53672941</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/53672941</guid><author>zlasd</author><pubDate>Thu, 15 Dec 2016 17:13:31 +0800</pubDate><description><![CDATA[支配集问题算法概论习题8.20 
　　在一个无向图G=(V, E)中，我们称V的一个子集D为一个占优集，是指每个（v属于V）都属于D或与D中一个节点为邻。在占优集问题中，输入为一个图和预算b，目标是求图的一个规模不超过b的占优集——如果该集存在。证明该问题是NP-完全的。 
　　注: 占优集即为支配集，是dominating set的另一种译法. 
　　证明 
　　我们不妨只考虑连通图，对于非连通图]]></description><category></category></item><item><title><![CDATA[[LeetCode 410] Split Array Largest Sum (二分答案/最大值最小化)]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/53521265</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/53521265</guid><author>zlasd</author><pubDate>Thu, 08 Dec 2016 17:15:00 +0800</pubDate><description><![CDATA[410. Split Array Largest SumGiven an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the la]]></description><category></category></item><item><title><![CDATA[[LeetCode 72] Edit Distance(编辑距离/动态规划/DP)]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/53428320</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/53428320</guid><author>zlasd</author><pubDate>Thu, 01 Dec 2016 23:24:31 +0800</pubDate><description><![CDATA[72. Edit DistanceGiven two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitte]]></description><category></category></item><item><title><![CDATA[[LeetCode 312] Burst Ballons (区间DP)]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/53401610</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/53401610</guid><author>zlasd</author><pubDate>Tue, 29 Nov 2016 22:42:29 +0800</pubDate><description><![CDATA[312. Burst BalloonsGiven n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i yo]]></description><category></category></item><item><title><![CDATA[[LeetCode 239] Sliding Window Maximum (Queap/队列快速求最大值)]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/53016339</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/53016339</guid><author>zlasd</author><pubDate>Thu, 03 Nov 2016 00:44:37 +0800</pubDate><description><![CDATA[239. Sliding Window MaximumGiven an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each]]></description><category></category></item><item><title><![CDATA[[LeetCode 315] Count of Smaller Numbers After Self (树状数组 Binary Indexed Tree)]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/52923397</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/52923397</guid><author>zlasd</author><pubDate>Tue, 25 Oct 2016 15:55:40 +0800</pubDate><description><![CDATA[315. Count of Smaller Numbers After SelfYou are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller element]]></description><category></category></item><item><title><![CDATA[[LeetCode 33]Search in Rotated Sorted Array (二分查找)]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/52878204</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/52878204</guid><author>zlasd</author><pubDate>Thu, 20 Oct 2016 23:10:37 +0800</pubDate><description><![CDATA[33.Search in Rotated Sorted ArraySuppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If fo]]></description><category></category></item><item><title><![CDATA[[LeetCode 403]Frog Jump (宽度优先搜索BFS)]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/52807552</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/52807552</guid><author>zlasd</author><pubDate>Thu, 13 Oct 2016 15:54:19 +0800</pubDate><description><![CDATA[BFS解决状态搜索问题，使用unordered_map记录信息]]></description><category></category></item><item><title><![CDATA[关于八码数问题有解与无解的证明]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/52718442</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/52718442</guid><author>zlasd</author><pubDate>Sat, 01 Oct 2016 20:01:09 +0800</pubDate><description><![CDATA[转载自【水木清华BBS精华区】：http://www.cnw3.org/smth/AI/5/8/00000001.htm 
发信人: YourMajesty (花痴~~~~小魔男), 信区: AI 
标  题: 关于八码数问题有解与无解的证明(zz) 
发信站: BBS 水木清华站 (Fri Nov 23 22:26:49 2001)8数码难题搜索时，有时候是无解的，8数码问题总共有9!种状态，如果]]></description><category></category></item><item><title><![CDATA[[LeetCode 124] Binary Tree Maximum Path Sum (DFS/二叉树)]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/52606390</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/52606390</guid><author>zlasd</author><pubDate>Wed, 21 Sep 2016 12:03:12 +0800</pubDate><description><![CDATA[递归求解二叉树]]></description><category></category></item><item><title><![CDATA[[LeetCode 23] Merge k Sorted Lists (最小堆)]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/52605601</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/52605601</guid><author>zlasd</author><pubDate>Wed, 21 Sep 2016 10:56:21 +0800</pubDate><description><![CDATA[使用最小堆进行链表的k路归并]]></description><category></category></item><item><title><![CDATA[[LeetCode 215]Kth Largest Element in an Array （分治法/快速排序）]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/52541452</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/52541452</guid><author>zlasd</author><pubDate>Wed, 14 Sep 2016 21:07:59 +0800</pubDate><description><![CDATA[215. Kth Largest Element in an ArrayFind the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example, 
Given [3,2]]></description><category></category></item><item><title><![CDATA[[LeetCode 4]Median of Two Sorted Arrays  二分查找]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/52528960</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/52528960</guid><author>zlasd</author><pubDate>Tue, 13 Sep 2016 20:04:08 +0800</pubDate><description><![CDATA[二分查找求解两有序数组合并后的中位数]]></description><category></category></item><item><title><![CDATA[[LeetCode 84, 85]Largest Rectangle in Histogram / Maximal Rectangle]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/52409182</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/52409182</guid><author>zlasd</author><pubDate>Fri, 02 Sep 2016 01:28:36 +0800</pubDate><description><![CDATA[LeetCode第84，85号题，解题报告。利用栈的O(n)算法]]></description><category></category></item><item><title><![CDATA[对位藏头诗 ——《集异璧之大成 》]]></title><link>https://blog.youkuaiyun.com/zlasd/article/details/52402457</link><guid>https://blog.youkuaiyun.com/zlasd/article/details/52402457</guid><author>zlasd</author><pubDate>Thu, 01 Sep 2016 18:34:36 +0800</pubDate><description><![CDATA[阿基里斯来拜访乌龟，看到乌龟家里有许多唱片。


阿基里斯：赫赫有名的法国作曲家德彪西你知道吧？你这里有没有他的作品？


　　乌龟：赫赫有名的得镖器？我可没听说过。我这儿倒收藏了不好“飞去来器”，就是那种扔出去能飞回来的飞镖。


阿基里斯：有名极了，不过这没关系。你这里到底都有谁的作品？我想总该有巴赫的吧？


　　乌龟：名曲我都有，巴赫的自然不用说了。你听过巴赫的曲子]]></description><category></category></item></channel></rss>