<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[(●—●)]]></title><description><![CDATA[科技?文艺:逗比!]]></description><link>https://blog.youkuaiyun.com/fxf1012</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; fxf1012]]></copyright><item><title><![CDATA[FaceWarehouse: a 3D Facial Expression Database for Visual Computing]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/46686225</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/46686225</guid><author>fxf1012</author><pubDate>Mon, 29 Jun 2015 20:23:53 +0800</pubDate><description><![CDATA[FaceWarehouse: a 3D Facial Expression Database for Visual ComputingIV.应用FaceWarehouse能被应用在多种视觉计算应用中。在这部分，我们展示4个实例应用：facial image manipulation，face component 
transfer，real-time performance-based facial]]></description><category></category></item><item><title><![CDATA[路径搜索之A*算法]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/46503657</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/46503657</guid><author>fxf1012</author><pubDate>Mon, 15 Jun 2015 14:42:36 +0800</pubDate><description><![CDATA[翻译自：http://theory.stanford.edu/~amitp/GameProgramming/我们想要解决的问题是在游戏中从一个起点到达终点来获取一个游戏的目标。路径搜索就是处理这样从起点到终点寻找一条好路径的问题——避免障碍物和敌人，并且最小化成本（燃油，时间，距离，装备，钱财等）。移动处理跟踪一条路径并沿着它运动的问题。这两者只关注其一是可行的的。一种极端情况下，一个复杂的路径寻找]]></description><category></category></item><item><title><![CDATA[《剑指Offer》面试题33：把数组排成最小的数]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45745533</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45745533</guid><author>fxf1012</author><pubDate>Fri, 15 May 2015 15:39:56 +0800</pubDate><description><![CDATA[//面试题33：把数组排成最小的数#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <Windows.h>using namespace std;const int prec = numeric_limits<long double>::digits10;//模板函数：类型转换]]></description><category></category></item><item><title><![CDATA[《CTCI》3.5 用两个栈实现队列]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45585645</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45585645</guid><author>fxf1012</author><pubDate>Fri, 08 May 2015 21:52:44 +0800</pubDate><description><![CDATA[《CTCI》 P1423 栈与队列题目3.5 实现一个MyQueue类，该类用两个栈来实现一个队列。解答#include <stack>template <typename T> class queue
{
public:
    void push(const T& val);
    void pop();
    const T& front();
    const T& back();]]></description><category></category></item><item><title><![CDATA[《剑指Offer》面试题28：字符串的排列]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45581745</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45581745</guid><author>fxf1012</author><pubDate>Fri, 08 May 2015 16:19:51 +0800</pubDate><description><![CDATA[《剑指Offer》 P154面试题28：字符串的排列题目解答//面试题28：字符串的全排列#include <string>
#include <iostream>
#include <Windows.h>using namespace std;void permutation(string s,int start,int &num)
{
    if (start == s.size() - 1)]]></description><category></category></item><item><title><![CDATA[LeetCode 80 Remove Duplicates from Sorted Array II]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45581665</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45581665</guid><author>fxf1012</author><pubDate>Fri, 08 May 2015 16:15:15 +0800</pubDate><description><![CDATA[LeetCode80 Remove Duplicates from Sorted Array II题目Follow up for “Remove Duplicates”: 
What if duplicates are allowed at most twice?For example, 
Given sorted array nums = [1,1,1,2,2,3],Your function s]]></description><category></category></item><item><title><![CDATA[LeetCode 26 Remove Duplicates from Sorted Array]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45566801</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45566801</guid><author>fxf1012</author><pubDate>Thu, 07 May 2015 21:19:12 +0800</pubDate><description><![CDATA[LeetCode26 Remove Duplicates from Sorted Array题目Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for an]]></description><category></category></item><item><title><![CDATA[《编程之美》2.1 求二进制中1的个数]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45565911</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45565911</guid><author>fxf1012</author><pubDate>Thu, 07 May 2015 20:08:33 +0800</pubDate><description><![CDATA[《编程之美》 P119第2章 数字之谜——数字中的技巧2.1 求二进制中1的个数题目对于一个字节（8bit）的无符号整型变量，求其二进制表示中“1”的个数，要求算法的执行效率尽可能高。解答]]></description><category></category></item><item><title><![CDATA[《CTCI》3.4 汉诺塔游戏]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45563577</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45563577</guid><author>fxf1012</author><pubDate>Thu, 07 May 2015 17:05:18 +0800</pubDate><description><![CDATA[《CTCI》 P1403 栈与队列题目3.4 In the classic problem of the Towers of Hanoi, you have 3 towers and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted in ascending o]]></description><category></category></item><item><title><![CDATA[《剑指Offer》 面试题27：二叉搜索树与双向链表]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45559455</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45559455</guid><author>fxf1012</author><pubDate>Thu, 07 May 2015 14:38:58 +0800</pubDate><description><![CDATA[《剑指Offer》 P151面试题27：二叉搜索树与双向链表题目输入一棵二叉搜索树，将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点，只能调整树中结点指针的指向。]]></description><category></category></item><item><title><![CDATA[《剑指Offer》面试题26：复杂链表的复制]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45559417</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45559417</guid><author>fxf1012</author><pubDate>Thu, 07 May 2015 12:42:35 +0800</pubDate><description><![CDATA[《剑指Offer》 P147面试题26：复杂链表的复制题目请实现函数ComplexListNode* Clone(ComplexListNode* pHead)，复制一个复杂链表。在复杂链表中，每个结点除了有一个m_pNext指针指向下一个结点外，还有一个m_pSibling指向链表中的任意结点或者NULL。结点的C++定义如下：struct ComplexListNode
{
    int m_]]></description><category></category></item><item><title><![CDATA[LeetCode 36 Valid Sudoku]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45482033</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45482033</guid><author>fxf1012</author><pubDate>Mon, 04 May 2015 15:53:17 +0800</pubDate><description><![CDATA[LeetCode36 Valid Sudoku题目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 parti]]></description><category></category></item><item><title><![CDATA[LeetCode 3 Longest Substring Without Repeating Characters]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45400093</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45400093</guid><author>fxf1012</author><pubDate>Thu, 30 Apr 2015 22:42:28 +0800</pubDate><description><![CDATA[LeetCode3 Longest Substring Without Repeating Characters题目Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating let]]></description><category></category></item><item><title><![CDATA[LeetCode 2 Add Two Numbers]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45400035</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45400035</guid><author>fxf1012</author><pubDate>Thu, 30 Apr 2015 22:37:30 +0800</pubDate><description><![CDATA[LeetCode2 Add Two Numbers题目You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbe]]></description><category></category></item><item><title><![CDATA[LeetCode 1 TwoSum]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45395261</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45395261</guid><author>fxf1012</author><pubDate>Thu, 30 Apr 2015 15:18:15 +0800</pubDate><description><![CDATA[LeetCode1.TwoSumGiven an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the]]></description><category></category></item><item><title><![CDATA[《CTCI》3.7 “猫狗”队列]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45333539</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45333539</guid><author>fxf1012</author><pubDate>Tue, 28 Apr 2015 11:22:22 +0800</pubDate><description><![CDATA[《CITI》P1453 栈与队列题目：3.7 An animal shelter holds only dogs and cats, and operates on a strictly “first in, first out” basis. People must adopt either the “oldest” (based on arrival time) of all animals a]]></description><category></category></item><item><title><![CDATA[《CTCI》3.6 用两个栈实现排序栈]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45333483</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45333483</guid><author>fxf1012</author><pubDate>Tue, 28 Apr 2015 11:21:26 +0800</pubDate><description><![CDATA[《CITI》P1433 栈与队列题目：3.6 Write a program to sort a stack in ascending order (with biggest items on top). You may use at most one additional stack to hold items, but you may not copy the elements into any]]></description><category></category></item><item><title><![CDATA[《CTCI》3.3 栈之栈]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45333311</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45333311</guid><author>fxf1012</author><pubDate>Tue, 28 Apr 2015 11:14:19 +0800</pubDate><description><![CDATA[《CITI》P1373 栈与队列题目：3.3 Imagine a (literal) stack of plates. If the stack gets too high, it might topple. Therefore, in real life, we would likely start a new stack when the previous stack exceeds some]]></description><category></category></item><item><title><![CDATA[《CTCI》2.7 检查链表是否为回文]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45268781</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45268781</guid><author>fxf1012</author><pubDate>Sat, 25 Apr 2015 11:17:45 +0800</pubDate><description><![CDATA[《CITI》P12 链表题目：2.7 Implement a function to check if a linked list is a palindrome]]></description><category></category></item><item><title><![CDATA[《CTCI》2.6 寻找有环链表的开头结点]]></title><link>https://blog.youkuaiyun.com/fxf1012/article/details/45268753</link><guid>https://blog.youkuaiyun.com/fxf1012/article/details/45268753</guid><author>fxf1012</author><pubDate>Sat, 25 Apr 2015 11:17:05 +0800</pubDate><description><![CDATA[《CITI》P1262 链表题目：2.6 Given a circular linked list, implement an algorithm which returns the node at the beginning of the loop.]]></description><category></category></item></channel></rss>