摘要: 问题描述:输入一个字符串,输出该字符串中对称的子字符串的最大长度。比如输入字符串“google”,由于该字符串里最长的对称子字符串是“goog”,因此输出4。#include <stdio.h>#include <string.h>#define N 10int Find_len(char a[], int &max_len);int Symmetry(char a[], int low, int high);int main(){char a[] = "abcdlgooogle";int start_pos = 0;int max_len 阅读全文
posted @ 2012-03-07 12:46 Never To Say Impossible 阅读(449) 评论(0) 推荐(0) 编辑