求公用字串的經典源碼

來源:互聯網
上載者:User

原始碼如下:

 

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

char *maxsubstr(char shortstring[], char longstring[])
{
  int i;
  int j;
  char *substr = malloc(256);
  longstring[strlen(longstring) - 1] = 'M';
  if(strstr(longstring, shortstring) != NULL)
    return shortstring;
  for(i = strlen(shortstring) - 1; i > 0; i--)
    for(j = 0; j < strlen(shortstring) - i; j++)
    {
      memcpy(substr, &shortstring[j], i);
      substr[i] = '/0';
      if(strstr(longstring, substr) != NULL)
        return substr;
    }
  return NULL;
}

 

int main(int argc, char **argv)
{
  char *str1 = malloc(256);
  char *str2 = malloc(256);
  char *common = NULL;
  puts("please input two strings:");
  scanf("%s %s", str1, str2);
  if(strlen(str1) < strlen(str2))
    common = maxsubstr(str1, str2);
  else
    common = maxsubstr(str2, str1);
  printf("the max common string is: %s/n", common);
  printf("/n%s", str2);
  return 0;
}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.