锘??xml version="1.0" encoding="utf-8" standalone="yes"?>免费观看成人鲁鲁鲁鲁鲁视频 ,欧美激情第一页xxx,久久久91精品http://www.shnenglu.com/ailab/鐢ㄥ績(jī)鍘誨仛濂借繖浠朵簨鎯?/description>zh-cnSun, 24 Aug 2025 02:25:47 GMTSun, 24 Aug 2025 02:25:47 GMT60other algorithmhttp://www.shnenglu.com/ailab/archive/2006/11/21/15523.htmlailabailabTue, 21 Nov 2006 14:11:00 GMThttp://www.shnenglu.com/ailab/archive/2006/11/21/15523.htmlhttp://www.shnenglu.com/ailab/comments/15523.htmlhttp://www.shnenglu.com/ailab/archive/2006/11/21/15523.html#Feedback0http://www.shnenglu.com/ailab/comments/commentRss/15523.htmlhttp://www.shnenglu.com/ailab/services/trackbacks/15523.html

ailab 2006-11-21 22:11 鍙戣〃璇勮
]]>tree algorithmhttp://www.shnenglu.com/ailab/archive/2006/11/21/15522.htmlailabailabTue, 21 Nov 2006 14:11:00 GMThttp://www.shnenglu.com/ailab/archive/2006/11/21/15522.htmlhttp://www.shnenglu.com/ailab/comments/15522.htmlhttp://www.shnenglu.com/ailab/archive/2006/11/21/15522.html#Feedback0http://www.shnenglu.com/ailab/comments/commentRss/15522.htmlhttp://www.shnenglu.com/ailab/services/trackbacks/15522.html
  • 聽(tīng)travel tree without stack or recursive
  • three travel using none recursive
  • delete a element in binary search tree
  • count words(using bst)
  • level-travel(using queue)


    • ailab 2006-11-21 22:11 鍙戣〃璇勮
    ]]>    array algorithmhttp://www.shnenglu.com/ailab/archive/2006/11/21/15521.htmlailabailabTue, 21 Nov 2006 14:11:00 GMThttp://www.shnenglu.com/ailab/archive/2006/11/21/15521.htmlhttp://www.shnenglu.com/ailab/comments/15521.htmlhttp://www.shnenglu.com/ailab/archive/2006/11/21/15521.html#Feedback0http://www.shnenglu.com/ailab/comments/commentRss/15521.htmlhttp://www.shnenglu.com/ailab/services/trackbacks/15521.html
  • insert a value into sorted array
  • select nth element
  • delete duplicate element
  • find there exits two same items in a array
  • find duplicate element a[0.N-1]. range from 1--N-1
  • a+b = s
  • find prim
  • occurs odd
  • findMidArray


    • ailab 2006-11-21 22:11 鍙戣〃璇勮
    ]]>    list algorithmhttp://www.shnenglu.com/ailab/archive/2006/11/21/15520.htmlailabailabTue, 21 Nov 2006 14:09:00 GMThttp://www.shnenglu.com/ailab/archive/2006/11/21/15520.htmlhttp://www.shnenglu.com/ailab/comments/15520.htmlhttp://www.shnenglu.com/ailab/archive/2006/11/21/15520.html#Feedback0http://www.shnenglu.com/ailab/comments/commentRss/15520.htmlhttp://www.shnenglu.com/ailab/services/trackbacks/15520.html
  • reverse_list (none-recursive && recursive)
  • merge list
  • find middle element of a list
  • find the nth element from the end of list
  • insert a element to a sorted single linked list
  • sort single linked list
  • swap every two element in a single linked list
  • circle && the start point
  • meet together
  • ploy multi

    • 聽(tīng)



    ailab 2006-11-21 22:09 鍙戣〃璇勮
    ]]>    string algorithmhttp://www.shnenglu.com/ailab/archive/2006/11/21/15517.htmlailabailabTue, 21 Nov 2006 13:58:00 GMThttp://www.shnenglu.com/ailab/archive/2006/11/21/15517.htmlhttp://www.shnenglu.com/ailab/comments/15517.htmlhttp://www.shnenglu.com/ailab/archive/2006/11/21/15517.html#Feedback0http://www.shnenglu.com/ailab/comments/commentRss/15517.htmlhttp://www.shnenglu.com/ailab/services/trackbacks/15517.html
  • word_count
  • reverse_string
  • reverse_word in a sentence
  • longest increasing subsequence
  • longest common subsequence
  • strstr
  • trim {space}
  • compress letter
  • atoi
  • atof
  • find all increasing subsequence
  • Find out if a string is a palindrome.
  • Delete characters from string 1 which are present in string 2
  • 聽(tīng)An array of pointers to (very long) strings. Find pointers to the (lexicographically) smallest and largest strings
  • Given a sequence of characters. How will you convert the lower case characters to upper case characters.


    • ailab 2006-11-21 21:58 鍙戣〃璇勮
    ]]>    dream come true http://www.shnenglu.com/ailab/archive/2006/11/20/15482.htmlailabailabMon, 20 Nov 2006 15:32:00 GMThttp://www.shnenglu.com/ailab/archive/2006/11/20/15482.htmlhttp://www.shnenglu.com/ailab/comments/15482.htmlhttp://www.shnenglu.com/ailab/archive/2006/11/20/15482.html#Feedback0http://www.shnenglu.com/ailab/comments/commentRss/15482.htmlhttp://www.shnenglu.com/ailab/services/trackbacks/15482.html涓や釜閾捐〃鏄惁鐩鎬氦錛屽鏋滅浉浜わ紝鎵懼嚭絎竴涓紑濮嬬浉浜ょ殑鑺傜偣

    node聽(tīng) * list(node聽(tīng) * list1,node聽(tīng) * list2)
     {
    聽(tīng)     if (list1聽(tīng) == 聽(tīng) null 聽(tīng) || 聽(tīng)list2聽(tīng) == 聽(tīng) null )
    聽(tīng)聽(tīng)聽(tīng)     return 聽(tīng) null ;
    聽(tīng)     int 聽(tīng)len1聽(tīng) = 聽(tīng) 0 ,len2聽(tīng) = 聽(tīng) 0 ;
    聽(tīng)node聽(tīng)     * p聽(tīng) = 聽(tīng)list1, * q聽(tīng) = 聽(tīng)list2;
    聽(tīng)     while (p -> next聽(tīng) != 聽(tīng) null )
    聽(tīng)聽(tīng)聽(tīng)     {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)len1聽(tīng)     ++ ;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)p聽(tīng)     = 聽(tīng) -> next;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)     while (q -> next聽(tīng) != 聽(tīng) null )
    聽(tīng)聽(tīng)     {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)len2聽(tīng)     ++ ;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)q聽(tīng)     = 聽(tīng)q -> next;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)     if (p聽(tīng) != 聽(tīng)q)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)     return 聽(tīng) null ;
    聽(tīng)聽(tīng)len1聽(tīng)     ++ ;
    聽(tīng)聽(tīng)len2聽(tīng)     ++ ;

    聽(tīng)聽(tīng)p聽(tīng)     = 聽(tīng)list1;q聽(tīng) = 聽(tīng)list2;

    聽(tīng)聽(tīng)     if (len1聽(tīng) > 聽(tīng)len2聽(tīng))
    聽(tīng)聽(tīng)     {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     int 聽(tīng)diff聽(tīng) = 聽(tīng)len1聽(tīng) - 聽(tīng)len2;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)p聽(tīng)     = 聽(tīng)list1;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     while (diff聽(tīng) > 聽(tīng) 0 聽(tīng) && 聽(tīng)p != 聽(tīng) null ;)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)p聽(tīng)     = 聽(tīng)p -> next;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)diff聽(tīng)     -- ;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)     else 聽(tīng)
    聽(tīng)     {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     int 聽(tīng)diff聽(tīng) = 聽(tīng)len2聽(tīng) - 聽(tīng)len1;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)q聽(tīng)     = 聽(tīng)list2;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     while (diff聽(tīng) > 聽(tīng) 0 聽(tīng) && 聽(tīng)q聽(tīng) != 聽(tīng) null )
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     {diff聽(tīng) -- ;聽(tīng)q = 聽(tīng)q -> next;}
    聽(tīng)聽(tīng)}

    聽(tīng)     while (p聽(tīng) != 聽(tīng)q)
    聽(tīng)     {
    聽(tīng)聽(tīng)聽(tīng)p聽(tīng)     = 聽(tīng)p -> next;q = 聽(tīng)q -> next;
    聽(tīng)}
    聽(tīng)聽(tīng)     return 聽(tīng)p
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)
    }


    ailab 2006-11-20 23:32 鍙戣〃璇勮
    ]]>    dream come true 5!http://www.shnenglu.com/ailab/archive/2006/11/20/15481.htmlailabailabMon, 20 Nov 2006 14:11:00 GMThttp://www.shnenglu.com/ailab/archive/2006/11/20/15481.htmlhttp://www.shnenglu.com/ailab/comments/15481.htmlhttp://www.shnenglu.com/ailab/archive/2006/11/20/15481.html#Feedback0http://www.shnenglu.com/ailab/comments/commentRss/15481.htmlhttp://www.shnenglu.com/ailab/services/trackbacks/15481.htmlrecursion and none-recursion

    node聽(tīng)*reverse_list(node聽(tīng)*head)
    {
    聽(tīng)聽(tīng)    if(head聽(tīng)==聽(tīng)null聽(tīng)||聽(tīng)head->next聽(tīng)==聽(tīng)null)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)    return聽(tīng)head;
    聽(tīng)聽(tīng)node聽(tīng)    *cur聽(tīng)=聽(tīng)head->next;
    聽(tīng)聽(tīng)node聽(tīng)    *pre聽(tīng)=聽(tīng)head;
    聽(tīng)聽(tīng)node聽(tīng)    *next聽(tīng)=聽(tīng)null;
    聽(tīng)聽(tīng)    while(cur聽(tīng)!=聽(tīng)null)
    聽(tīng)聽(tīng)    {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)next聽(tīng)    =聽(tīng)cur->next;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)cur    ->next聽(tīng)=聽(tīng)pre;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)pre聽(tīng)    =聽(tīng)cur;聽(tīng)聽(tīng)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)cur聽(tīng)    =聽(tīng)next;
    聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)head    ->next聽(tīng)=聽(tīng)null;
    聽(tīng)聽(tīng)head聽(tīng)    =聽(tīng)pre;
    聽(tīng)聽(tīng)reurn聽(tīng)head;
    }


    node聽(tīng)*reverse_list(node聽(tīng)*head)
    {
    聽(tīng)聽(tīng)    if(head聽(tīng)==聽(tīng)null聽(tīng)||聽(tīng)head->next聽(tīng)==聽(tīng)null)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)    return聽(tīng)head;
    聽(tīng)聽(tīng)node聽(tīng)    *cur聽(tīng)=聽(tīng)head->next;
    聽(tīng)聽(tīng)node聽(tīng)    *next聽(tīng)=聽(tīng)null;
    聽(tīng)聽(tīng)head    ->next聽(tīng)=聽(tīng)null;
    聽(tīng)聽(tīng)    while(cur聽(tīng)!=聽(tīng)null)
    聽(tīng)    {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)next聽(tīng)    =聽(tīng)cur->next;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)cur    ->next聽(tīng)=聽(tīng)head;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)head聽(tīng)    =聽(tīng)cur;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)cur聽(tīng)    =聽(tīng)next;
    聽(tīng)}
    聽(tīng)聽(tīng)    return聽(tīng)head;
    聽(tīng)聽(tīng)
    }


    ailab 2006-11-20 22:11 鍙戣〃璇勮
    ]]>    dream come true! http://www.shnenglu.com/ailab/archive/2006/11/20/15480.htmlailabailabMon, 20 Nov 2006 14:04:00 GMThttp://www.shnenglu.com/ailab/archive/2006/11/20/15480.htmlhttp://www.shnenglu.com/ailab/comments/15480.htmlhttp://www.shnenglu.com/ailab/archive/2006/11/20/15480.html#Feedback0http://www.shnenglu.com/ailab/comments/commentRss/15480.htmlhttp://www.shnenglu.com/ailab/services/trackbacks/15480.html node聽(tīng) * merge(node聽(tīng) * head1,node聽(tīng) * head2)
     {
    聽(tīng)聽(tīng)     if (head1聽(tīng) == 聽(tīng) null )
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     return 聽(tīng)head2;
    聽(tīng)聽(tīng)     if (head2聽(tīng) == 聽(tīng) null )
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     return 聽(tīng)head1;
    聽(tīng)聽(tīng)reverse_list(     & head2);
    聽(tīng)聽(tīng)node聽(tīng)     * head3聽(tīng) = 聽(tīng) null , * cur聽(tīng) = 聽(tīng) null ;
    聽(tīng)聽(tīng)node聽(tīng)     * p聽(tīng) = 聽(tīng)head1, * q聽(tīng) = 聽(tīng)head2;
    聽(tīng)聽(tīng)     while (p聽(tīng) != 聽(tīng) null 聽(tīng) && 聽(tīng)q聽(tīng) != 聽(tīng) null )
    聽(tīng)聽(tīng)     {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)     if (p -> value聽(tīng) < 聽(tīng)q -> value)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)     {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     if (head3聽(tīng) == 聽(tīng) null )
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)head3聽(tīng)     = 聽(tīng)p;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)cur聽(tīng)     = 聽(tīng)p;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)p聽(tīng)     = 聽(tīng)p -> next;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     else
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)cur     -> next聽(tīng) = 聽(tīng)p;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)cur聽(tīng)     = 聽(tīng)p;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)p聽(tīng)     = 聽(tīng)p -> next;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     else
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     if (head3聽(tīng) == 聽(tīng) null )
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)head3聽(tīng)     = 聽(tīng)q;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)cur聽(tīng)     = 聽(tīng)q;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)q聽(tīng)     = 聽(tīng)q -> next;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     else
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)     {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)cur     -> next聽(tīng) = 聽(tīng)q;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)cur聽(tīng)     = 聽(tīng)q;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)q     = q -> next;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)聽(tīng)     if (p聽(tīng) == 聽(tīng) null )
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)cur     -> next聽(tīng) = 聽(tīng)q;
    聽(tīng)聽(tīng)聽(tīng)     if (q聽(tīng) == 聽(tīng) null )
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)cur     -> next聽(tīng) = 聽(tīng)p;
    聽(tīng)聽(tīng)聽(tīng)     return 聽(tīng)head3;
    }

    ailab 2006-11-20 22:04 鍙戣〃璇勮
    ]]>    dream come true!(4) strstrhttp://www.shnenglu.com/ailab/archive/2006/11/20/15478.htmlailabailabMon, 20 Nov 2006 13:50:00 GMThttp://www.shnenglu.com/ailab/archive/2006/11/20/15478.htmlhttp://www.shnenglu.com/ailab/comments/15478.htmlhttp://www.shnenglu.com/ailab/archive/2006/11/20/15478.html#Feedback0http://www.shnenglu.com/ailab/comments/commentRss/15478.htmlhttp://www.shnenglu.com/ailab/services/trackbacks/15478.html
    char聽(tīng)*strstr(const聽(tīng)char聽(tīng)*str,const聽(tīng)char聽(tīng)*sub)
    {
    聽(tīng)聽(tīng)    if(str聽(tīng)==聽(tīng)null聽(tīng)||聽(tīng)sub聽(tīng)==聽(tīng)null)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)    return聽(tīng)null;
    聽(tīng)聽(tīng)    const聽(tīng)char聽(tīng)*p聽(tīng)=聽(tīng)str;
    聽(tīng)聽(tīng)    const聽(tīng)char聽(tīng)*q聽(tīng)=聽(tīng)sub;
    聽(tīng)聽(tīng)    while(*str聽(tīng)!=聽(tīng)'\0'聽(tīng)&&聽(tīng)*sub聽(tīng)!=聽(tīng)'\0')
    聽(tīng)聽(tīng)    {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)    if(*str++聽(tīng)!=聽(tīng)*sub++)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)    {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)str聽(tīng)    =聽(tīng)++p;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)sub聽(tīng)    =聽(tīng)q;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)聽(tīng)}
    聽(tīng)聽(tīng)    if(*sub聽(tīng)==聽(tīng)'\0')
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)    return聽(tīng)p;
    聽(tīng)聽(tīng)    else
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)    return聽(tīng)null;
    }
    char聽(tīng)*strstr(const聽(tīng)char聽(tīng)*str,const聽(tīng)char聽(tīng)*sub)
    {
    聽(tīng)聽(tīng)    if(str聽(tīng)==聽(tīng)null聽(tīng)||聽(tīng)sub聽(tīng)==聽(tīng)null)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)    return聽(tīng)null;
    聽(tīng)聽(tīng)    const聽(tīng)char聽(tīng)*p聽(tīng)=聽(tīng)str;
    聽(tīng)聽(tīng)    const聽(tīng)char聽(tīng)*q聽(tīng)=聽(tīng)sub;
    聽(tīng)聽(tīng)    for(;*str聽(tīng)!=聽(tīng)'\0'聽(tīng);str++)
    聽(tīng)聽(tīng)    {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)    if(*str聽(tīng)!=聽(tīng)*sub)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)    continue;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)p聽(tīng)    =聽(tīng)str;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)    while(1)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)    {
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)    if(*sub聽(tīng)==聽(tīng)'\0')
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)    return聽(tīng)str;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)    if(*p++聽(tīng)!=聽(tīng)*sub++)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)    break;
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)}    聽(tīng)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)sub聽(tīng)    =聽(tīng)q;
    }


    ailab 2006-11-20 21:50 鍙戣〃璇勮
    ]]>    dream come true!(3)http://www.shnenglu.com/ailab/archive/2006/11/20/15474.htmlailabailabMon, 20 Nov 2006 13:20:00 GMThttp://www.shnenglu.com/ailab/archive/2006/11/20/15474.htmlhttp://www.shnenglu.com/ailab/comments/15474.htmlhttp://www.shnenglu.com/ailab/archive/2006/11/20/15474.html#Feedback0http://www.shnenglu.com/ailab/comments/commentRss/15474.htmlhttp://www.shnenglu.com/ailab/services/trackbacks/15474.htmla[k+1:n-1]浜ゆ崲浣嶇疆錛岃姹傜畻娉曞湪鏈鍧忕殑鎯呭喌涓嬭楁椂O(n)錛屼笖鐢ㄥ埌鐨勮緟鍔╃┖闂翠負(fù)O(1)銆?br />
    in fact,the essence of above question is "revers two times"
    (a'b')' = ba;

    void聽(tīng)reverse(int聽(tīng)*a,int聽(tīng)n,int聽(tīng)k)
    {
    聽(tīng)聽(tīng)    if(a聽(tīng)==聽(tīng)null聽(tīng)||聽(tīng)n聽(tīng)<聽(tīng)0聽(tīng)||聽(tīng)k聽(tīng)>聽(tīng)n)
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)    return;
    聽(tīng)聽(tīng)revers_array(a,    0,n-1);
    聽(tīng)聽(tīng)revers_array(a,    0,k);
    聽(tīng)聽(tīng)revers_array(a,k    +1,n-1);
    聽(tīng)聽(tīng)
    }


    ailab 2006-11-20 21:20 鍙戣〃璇勮
    ]]>     久久精品国产99久久香蕉| 波多野结衣久久精品| 伊人久久综合热线大杳蕉下载| 亚洲天堂久久精品| 久久婷婷是五月综合色狠狠| 亚洲狠狠婷婷综合久久蜜芽| 青青青国产成人久久111网站| 久久久不卡国产精品一区二区| 久久综合九色综合网站| 久久精品国产亚洲精品| 国产精品99久久免费观看| 欧美精品九九99久久在观看| 青青草国产精品久久| 久久婷婷五月综合色奶水99啪| 韩国三级大全久久网站| 性做久久久久久久| 一本色综合久久| 久久97久久97精品免视看| 97久久超碰成人精品网站| 久久精品视频一| 一本色道久久88综合日韩精品| 国产成人无码精品久久久免费| 精品久久久噜噜噜久久久| 久久人人爽人人爽人人爽| 国内精品伊人久久久久妇| 久久99国产一区二区三区| 国产精品狼人久久久久影院| aaa级精品久久久国产片| 无码国产69精品久久久久网站| 99久久做夜夜爱天天做精品| 久久久WWW成人免费精品| 久久精品国产清自在天天线| 国产精品狼人久久久久影院| 久久久WWW成人免费精品| 久久精品不卡| 久久亚洲AV成人无码| 久久人人青草97香蕉| 7777精品伊人久久久大香线蕉 | 久久国产精品无码一区二区三区| 亚洲欧洲久久久精品| 日本加勒比久久精品|