字符串最大子串求法
(2013-11-05 16:14:09)
标签:
searchit算法 |
分类: 技术 |
给你一个字符串。求它最大子串。满足以下条件 包含的不重复元素不超过三个
public class MaxSubStr {
static
String sample1 = "aabcccaddddaadd";
static
String sample2 = "aabcccadddd";
static
String maxSubStr(String str) {
char[] chs = new char[str.length()];
str.getChars(0, str.length(), chs, 0);
int maxLen = 0;
String maxSubStr = null;
for (int i = 0; i < str.length(); i++) {
StringBuilder sb = new StringBuilder();
int j = i;
int maxCharNum = 0;
for (; j < str.length(); j++) {
if (maxCharNum < 3) {
if (sb.indexOf(String.valueOf(chs[j])) < 0) {
maxCharNum++;
}
sb.append(chs[j]);
} else if (maxCharNum == 3) {
if (sb.indexOf(String.valueOf(chs[j])) < 0) {
break;
public class MaxSubStr {