<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[I am David!]]></title><description><![CDATA[原博客地址----https://blog.dxscx.com]]></description><link>https://blog.youkuaiyun.com/admintest1</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; admintest1]]></copyright><item><title><![CDATA[44. 通配符匹配]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/105211530</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/105211530</guid><author>admintest1</author><pubDate>Mon, 30 Mar 2020 23:06:09 +0800</pubDate><description><![CDATA[O(n),参考双指针贪心


int charArraySize(char *arr){
    int i=-1;
    while(arr[++i]!='\0'){
    }
    return i;
}

bool isMatch(char * s, char * p){
    int i = 0, j = 0, iStar = -1, jStar = -1, m = charArr...]]></description><category></category></item><item><title><![CDATA[134. 加油站]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/105189276</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/105189276</guid><author>admintest1</author><pubDate>Sun, 29 Mar 2020 23:16:54 +0800</pubDate><description><![CDATA[O(n), 参考官方解释,注意边界值

int canCompleteCircuit(int* gas, int gasSize, int* cost, int costSize){
        int currSum = 0,  totalSum = 0 , startIdx = 0 ;
        for(int idx=0; idx&lt;gasSize; idx++){
     ...]]></description><category></category></item><item><title><![CDATA[跳跃游戏]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/105170762</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/105170762</guid><author>admintest1</author><pubDate>Sat, 28 Mar 2020 22:58:21 +0800</pubDate><description><![CDATA[暂时打卡

]]></description><category></category></item><item><title><![CDATA[455. 分发饼干]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/105153223</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/105153223</guid><author>admintest1</author><pubDate>Fri, 27 Mar 2020 23:30:42 +0800</pubDate><description><![CDATA[O(nlog(n))

int cmp(const void * a, const void * b)
{
    return * (int * )b - * (int * )a;
}

int findContentChildren(int* g, int gSize, int* s, int sSize){
    qsort(g, gSize, sizeof(int), cmp);
   ...]]></description><category></category></item><item><title><![CDATA[392. 判断子序列]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/105129423</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/105129423</guid><author>admintest1</author><pubDate>Thu, 26 Mar 2020 22:03:07 +0800</pubDate><description><![CDATA[O(n)

bool isSubsequence(char * s, char * t){
    while(*t!='\0'){
        if(*s=='\0'){
            break;
        }
        if(*s==*t){
            s++;
        }
        t++;
    }
    return *s=='...]]></description><category></category></item><item><title><![CDATA[99. 恢复二叉搜索树]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/105084133</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/105084133</guid><author>admintest1</author><pubDate>Tue, 24 Mar 2020 23:08:34 +0800</pubDate><description><![CDATA[int midOrder(struct TreeNode **pre, struct TreeNode **err1, struct TreeNode **err2, struct TreeNode *root)
{
    if (root == NULL) return 0;
    
    if (midOrder(pre, err1, err2, root-&gt;left) == -1...]]></description><category></category></item><item><title><![CDATA[数据的探索性分析（EDA）]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/105078966</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/105078966</guid><author>admintest1</author><pubDate>Tue, 24 Mar 2020 19:13:33 +0800</pubDate><description><![CDATA[数据引入
import pandas as pd
df=pd.read_csv("./used_car_train_20200313.csv")

简单查看数据
df.head()

数据格式相当奇怪

]]></description><category></category></item><item><title><![CDATA[95. 不同的二叉搜索树 II]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/105061190</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/105061190</guid><author>admintest1</author><pubDate>Mon, 23 Mar 2020 23:36:49 +0800</pubDate><description><![CDATA[class Solution:
    def generateTrees(self, n):
        """
        :type n: int
        :rtype: List[TreeNode]
        """
        def generate_trees(start, end):
            if start &gt; end:
     ...]]></description><category></category></item><item><title><![CDATA[94. 二叉树的中序遍历]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/105039138</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/105039138</guid><author>admintest1</author><pubDate>Sun, 22 Mar 2020 23:47:53 +0800</pubDate><description><![CDATA[O(n)

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

void helper(struct TreeNode* node,int *rst,...]]></description><category></category></item><item><title><![CDATA[面试题55 - I. 二叉树的深度]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/105020514</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/105020514</guid><author>admintest1</author><pubDate>Sat, 21 Mar 2020 23:56:44 +0800</pubDate><description><![CDATA[O(n)


/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

int max(int a,int b){
    return a&gt;b?a:...]]></description><category></category></item><item><title><![CDATA[面试题55 - I. 二叉树的深度]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/105020387</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/105020387</guid><author>admintest1</author><pubDate>Sat, 21 Mar 2020 23:48:14 +0800</pubDate><description><![CDATA[O(n)


/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

int max(int a,int b){
    return a&gt;b?a:...]]></description><category></category></item><item><title><![CDATA[101. 对称二叉树]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/104999467</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/104999467</guid><author>admintest1</author><pubDate>Fri, 20 Mar 2020 21:45:58 +0800</pubDate><description><![CDATA[O(n)

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

bool mirror(struct TreeNode* left,struct Tr...]]></description><category></category></item><item><title><![CDATA[100. 相同的树]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/104974605</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/104974605</guid><author>admintest1</author><pubDate>Thu, 19 Mar 2020 19:30:44 +0800</pubDate><description><![CDATA[O(n),简单递归


/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */


bool isSameTree(struct TreeNode* p, ...]]></description><category></category></item><item><title><![CDATA[10. 正则表达式匹配]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/104953759</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/104953759</guid><author>admintest1</author><pubDate>Wed, 18 Mar 2020 21:12:26 +0800</pubDate><description><![CDATA[转载自leetcode
解题思路
1、如果p为空，s为空匹配，s非空不匹配；
2、s非空，p == s || p == '.'时第一个字符匹配；
3、(p+1) != ''，则递归判断剩下的是否匹配 first_match &amp;&amp; isMatch(++s, ++p)
4、(p+1) == '*'，则有两种情况匹配：
a: *匹配0个字符，s匹配剩下的，即isMatch(s, p+2)...]]></description><category></category></item><item><title><![CDATA[5. 最长回文子串]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/104930908</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/104930908</guid><author>admintest1</author><pubDate>Tue, 17 Mar 2020 20:57:00 +0800</pubDate><description><![CDATA[这是我目前看到最舒服的一个了，这个有点复杂，今日先copy,再消化。
居然也有这个成绩，只能说给力。


void help(char *s, int N, int left, int right, int *start, int *len) {
    while (left &gt;= 0 &amp;&amp; right &lt; N &amp;&amp; s[left] == s[righ...]]></description><category></category></item><item><title><![CDATA[3. 无重复字符的最长子串]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/104911747</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/104911747</guid><author>admintest1</author><pubDate>Mon, 16 Mar 2020 23:49:04 +0800</pubDate><description><![CDATA[O(n)
int lengthOfLongestSubstring(char * s){
    int m[512]={-1};
    int ptr=0;
    char c;
    int maxLen=0;
    int len=0;
    while((c=s[ptr++])!='\0'){
        int idx=(int)c;
        if(m[idx]&g...]]></description><category></category></item><item><title><![CDATA[20. 有效的括号]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/104889315</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/104889315</guid><author>admintest1</author><pubDate>Sun, 15 Mar 2020 23:22:00 +0800</pubDate><description><![CDATA[O(n),为了优化空间的话可以动态按需分配栈空间能使用更小的空间,比如可以使用双向链表来优化,不过需要在链表的指针空间和测试用例中是长字符串快速不匹配还是长串临近结尾不匹配或直接匹配做权衡,如果是后者肯能带来更多的内存消耗.

bool isValid(char * s){
    char *stack=malloc(sizeof(char)*strlen(s));
    int idx=0;...]]></description><category></category></item><item><title><![CDATA[14. 最长公共前缀]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/104871301</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/104871301</guid><author>admintest1</author><pubDate>Sat, 14 Mar 2020 23:54:16 +0800</pubDate><description><![CDATA[O(n),比较简单,不进行分析.

char * longestCommonPrefix(char ** strs, int strsSize){
    char *commomPrefix = malloc(500);
    int idx=0;
    while(strsSize&gt;0){//这一个很奇怪的....
        bool sameChar=true;
      ...]]></description><category></category></item><item><title><![CDATA[13. 罗马数字转整数]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/104852638</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/104852638</guid><author>admintest1</author><pubDate>Fri, 13 Mar 2020 23:54:41 +0800</pubDate><description><![CDATA[O(n),未完待续
int readANum(char *s){
    char c=s[0];
    if(c=='\0'){
        return 0;
    }
    s=s[1];
    if(c=='I'){
        
        return 1;
    }
    return 0;
}
int romanToInt(char * s){
    in...]]></description><category></category></item><item><title><![CDATA[23. Merge k Sorted Lists]]></title><link>https://blog.youkuaiyun.com/admintest1/article/details/104826937</link><guid>https://blog.youkuaiyun.com/admintest1/article/details/104826937</guid><author>admintest1</author><pubDate>Thu, 12 Mar 2020 20:24:37 +0800</pubDate><description><![CDATA[时间;O(kn),空间:O(1),虽然第一遍效果不是很好，但就加了一个head-&gt;next=NULL就通过了，还是在没调试的情况下直接accept,这类似于手写代码，给自己点个赞。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *ne...]]></description><category></category></item></channel></rss>