<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[john_and_betty的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/asasopo</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; asasopo]]></copyright><item><title><![CDATA[wamp server搭建]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/22846497</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/22846497</guid><author>asasopo</author><pubDate>Thu, 03 Apr 2014 08:45:29 +0800</pubDate><description><![CDATA[参考
下载wampserver，在php100
把iis软件关掉，不然会影响wamp server的使用


(1)新建虚拟目录 php

                  a. WampServer菜单-->Apache-->alias目录-->添加一个alias

                  b.输入虚拟目录的访问名称：如 php

              ]]></description><category></category></item><item><title><![CDATA[Palindrome Number]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/22324669</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/22324669</guid><author>asasopo</author><pubDate>Thu, 27 Mar 2014 21:57:38 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool isPalindrome(int x) {
        if(x<0)
            return false;
        int a=x,b=x;
        int te=0;
        while(a!=0)
        {
            te=te*10+a%10;
      ]]></description><category></category></item><item><title><![CDATA[Valid Sudoku]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/22205783</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/22205783</guid><author>asasopo</author><pubDate>Wed, 26 Mar 2014 19:58:26 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool isValidSudoku(vector > &board) {
        for(int i=0;i<9;i++)
           for(int j=0;j<9;j++)
           {
               if(board[i][j]!='.')
                  if(!i]]></description><category></category></item><item><title><![CDATA[Sudoku Solver]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/22204993</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/22204993</guid><author>asasopo</author><pubDate>Wed, 26 Mar 2014 19:48:48 +0800</pubDate><description><![CDATA[class Solution {
public:
    void solveSudoku(vector > &board) {
         solve(board);
    }
    bool solve(vector>&board)
    {
        for(int i=0;i<9;i++)
            for(int j=0;j<9;j++)
        ]]></description><category></category></item><item><title><![CDATA[Combination Sum]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/22090391</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/22090391</guid><author>asasopo</author><pubDate>Tue, 25 Mar 2014 19:25:44 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector>res;
    vector > combinationSum(vector &candidates, int target) {
        vectorpath;
        combination(candidates,target,path,0);
        return res;
    }
    ]]></description><category></category></item><item><title><![CDATA[Divide Two Integers]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/22088647</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/22088647</guid><author>asasopo</author><pubDate>Tue, 25 Mar 2014 19:04:18 +0800</pubDate><description><![CDATA[class Solution {
public:
    int divide(int dividend, int divisor) {
        if(dividend==0)
            return 0;
        int tag=0;
        if(dividend>0&&divisor0)
            tag=1;
        long l]]></description><category></category></item><item><title><![CDATA[Remove Duplicates from Sorted Array II]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/22085149</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/22085149</guid><author>asasopo</author><pubDate>Tue, 25 Mar 2014 18:18:47 +0800</pubDate><description><![CDATA[class Solution {
public:
    int removeDuplicates(int A[], int n) {
        if(n<=1)
            return n;
        int j=1;
        int value=A[0];
        int count=1;
        for(int i=1;i<n;i++)
  ]]></description><category></category></item><item><title><![CDATA[Generate Parentheses]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/21989517</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/21989517</guid><author>asasopo</author><pubDate>Mon, 24 Mar 2014 21:32:59 +0800</pubDate><description><![CDATA[class Solution {
public:
    vectorres;
    vector generateParenthesis(int n) {
        generate(0,2*n,0,0,"");
        return res;
    }
    void generate(int dep,int maxdep,int leftnum,int lefttotal]]></description><category></category></item><item><title><![CDATA[Unique Binary Search Trees II]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/21985075</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/21985075</guid><author>asasopo</author><pubDate>Mon, 24 Mar 2014 20:18:54 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector generateTrees(int n) {
        return generate(0,n-1);
    }
    vector generate(int begin,int end)
    {
        vectorres;
        if(begin>end)
        {
       ]]></description><category></category></item><item><title><![CDATA[Convert Sorted List to Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/21980781</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/21980781</guid><author>asasopo</author><pubDate>Mon, 24 Mar 2014 19:17:14 +0800</pubDate><description><![CDATA[class Solution {
public:
    TreeNode *sortedListToBST(ListNode *head) {
        ListNode *p;
        int count=0;
        p=head;
        while(p!=NULL)
        {
            count++;
            p=p]]></description><category></category></item><item><title><![CDATA[Convert Sorted Array to Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/21977479</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/21977479</guid><author>asasopo</author><pubDate>Mon, 24 Mar 2014 18:21:59 +0800</pubDate><description><![CDATA[智商是硬伤啊，昨天在华为做了一道简单的递归都没写出来，尼玛，现在想想实在是愚蠢至极，还特么想拿华为当垫脚石，递归都不会




class Solution {
public:
    TreeNode *sortedArrayToBST(vector &num) {
        return sorta(num,0,num.size()-1);
    }
    TreeNode]]></description><category></category></item><item><title><![CDATA[Insert Interval]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/21829617</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/21829617</guid><author>asasopo</author><pubDate>Sat, 22 Mar 2014 22:03:46 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector insert(vector &intervals, Interval newInterval) {
        vectorres;
        for(int i=0;i<intervals.size();i++)
        {
            if(intervals[i].end<newInterv]]></description><category></category></item><item><title><![CDATA[Unique PatUnique Paths II]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/21826627</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/21826627</guid><author>asasopo</author><pubDate>Sat, 22 Mar 2014 21:19:41 +0800</pubDate><description><![CDATA[class Solution {
public:
    int uniquePathsWithObstacles(vector > &obstacleGrid) {
       if(obstacleGrid.size()==0)
          return 0;
       int wide=obstacleGrid.size();
       int len=obstacleGr]]></description><category></category></item><item><title><![CDATA[Best Time to Buy and Sell Stock III]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/21823899</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/21823899</guid><author>asasopo</author><pubDate>Sat, 22 Mar 2014 20:43:46 +0800</pubDate><description><![CDATA[class Solution {
public:
    int maxProfit(vector &prices) {
        if(prices.size()<=1)
            return 0;
        int left[prices.size()];
        int minp=prices[0];
        left[0]=0;
        ]]></description><category></category></item><item><title><![CDATA[Wildcard Matching]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/21748649</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/21748649</guid><author>asasopo</author><pubDate>Fri, 21 Mar 2014 22:50:44 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool isMatch(const char *s, const char *p) {
        const char *ss=s;
        const char *star=NULL;
        
        while(*s!='\0')
        {
            if(*s==*p||*s=]]></description><category></category></item><item><title><![CDATA[Word Ladder]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/21719699</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/21719699</guid><author>asasopo</author><pubDate>Fri, 21 Mar 2014 15:13:33 +0800</pubDate><description><![CDATA[class Solution {
public:
    int ladderLength(string start, string end, unordered_set &dict) {
        queue>q;
        unordered_setvisited;
        q.push(make_pair(start,1));
        visited.insert]]></description><category></category></item><item><title><![CDATA[Word Break II]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/21716703</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/21716703</guid><author>asasopo</author><pubDate>Fri, 21 Mar 2014 14:40:25 +0800</pubDate><description><![CDATA[class Solution {
public:
vectorres;
vectortemp;
vector*dp;
vector wordBreak(string s,unordered_set&dict)
{
    dp=new vector[s.size()];
	for(int i=0;i<s.size();i++)
	    for(int j=i;j<s.size();j++)
  ]]></description><category></category></item><item><title><![CDATA[Palindrome Partitioning II]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/21646389</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/21646389</guid><author>asasopo</author><pubDate>Thu, 20 Mar 2014 20:53:39 +0800</pubDate><description><![CDATA[1
2
定义函数
D[i,n] = 区间[i,n]之间最小的cut数，n为字符串长度
 a   b   a   b   b   b   a   b   b   a   b   a
                     i                                  n
如果现在求[i,n]之间的最优解？应该是多少？简单看一看，至少有下面一个解
 a   b]]></description><category></category></item><item><title><![CDATA[Palindrome Partitioning]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/21643763</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/21643763</guid><author>asasopo</author><pubDate>Thu, 20 Mar 2014 20:04:06 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector> partition(string s) {
        vector>res;
        vectorpath;
        if(s.size()==0)
           return res;
        store(res,path,s);
    }
    void store(vector]]></description><category></category></item><item><title><![CDATA[binary tree zigzag Level Order Traversal]]></title><link>https://blog.youkuaiyun.com/asasopo/article/details/21642175</link><guid>https://blog.youkuaiyun.com/asasopo/article/details/21642175</guid><author>asasopo</author><pubDate>Thu, 20 Mar 2014 19:21:10 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector > zigzagLevelOrder(TreeNode *root){
        vector>res;
        if(root==NULL)
            return res;
        vectorpath;
        vectorpath_val;
        path_val.]]></description><category></category></item></channel></rss>