leetcode/ImplementStrStr.java at master · Susheng/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35


/**
 * Implement strStr().
 *
 * Returns a pointer to the first occurrence of needle in haystack, or null if
 * needle is not part of haystack.
 */

publicclassImplementStrStr {
publicStringstrStr(Stringhaystack, Stringneedle) {
inti = 0;
intlen1 = haystack.length();
intlen2 = needle.length();
if (len1 == 0 && len2 == 0)
return"";
for (; i < len1; i++) {
inta = i;
intb = 0;
booleanmatch = true;
while (b < len2) {
if (a >= len1 || haystack.charAt(a) != needle.charAt(b)) {
match = false;
break;
 } else {
a++;
b++;
 }
 }
if (match)
returnhaystack.substring(i);
 }
returnnull;
	}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35


/**
 * Implement strStr().
 *
 * Returns a pointer to the first occurrence of needle in haystack, or null if
 * needle is not part of haystack.
 */

publicclassImplementStrStr {
publicStringstrStr(Stringhaystack, Stringneedle) {
inti = 0;
intlen1 = haystack.length();
intlen2 = needle.length();
if (len1 == 0 && len2 == 0)
return"";
for (; i < len1; i++) {
inta = i;
intb = 0;
booleanmatch = true;
while (b < len2) {
if (a >= len1 || haystack.charAt(a) != needle.charAt(b)) {
match = false;
break;
 } else {
a++;
b++;
 }
 }
if (match)
returnhaystack.substring(i);
 }
returnnull;
	}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35


/**
 * Implement strStr().
 *
 * Returns a pointer to the first occurrence of needle in haystack, or null if
 * needle is not part of haystack.
 */

publicclassImplementStrStr {
publicStringstrStr(Stringhaystack, Stringneedle) {
inti = 0;
intlen1 = haystack.length();
intlen2 = needle.length();
if (len1 == 0 && len2 == 0)
return"";
for (; i < len1; i++) {
inta = i;
intb = 0;
booleanmatch = true;
while (b < len2) {
if (a >= len1 || haystack.charAt(a) != needle.charAt(b)) {
match = false;
break;
 } else {
a++;
b++;
 }
 }
if (match)
returnhaystack.substring(i);
 }
returnnull;
	}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35


/**
 * Implement strStr().
 *
 * Returns a pointer to the first occurrence of needle in haystack, or null if
 * needle is not part of haystack.
 */

publicclassImplementStrStr {
publicStringstrStr(Stringhaystack, Stringneedle) {
inti = 0;
intlen1 = haystack.length();
intlen2 = needle.length();
if (len1 == 0 && len2 == 0)
return"";
for (; i < len1; i++) {
inta = i;
intb = 0;
booleanmatch = true;
while (b < len2) {
if (a >= len1 || haystack.charAt(a) != needle.charAt(b)) {
match = false;
break;
 } else {
a++;
b++;
 }
 }
if (match)
returnhaystack.substring(i);
 }
returnnull;
	}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35


/**
 * Implement strStr().
 *
 * Returns a pointer to the first occurrence of needle in haystack, or null if
 * needle is not part of haystack.
 */

publicclassImplementStrStr {
publicStringstrStr(Stringhaystack, Stringneedle) {
inti = 0;
intlen1 = haystack.length();
intlen2 = needle.length();
if (len1 == 0 && len2 == 0)
return"";
for (; i < len1; i++) {
inta = i;
intb = 0;
booleanmatch = true;
while (b < len2) {
if (a >= len1 || haystack.charAt(a) != needle.charAt(b)) {
match = false;
break;
 } else {
a++;
b++;
 }
 }
if (match)
returnhaystack.substring(i);
 }
returnnull;
	}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35


/**
 * Implement strStr().
 *
 * Returns a pointer to the first occurrence of needle in haystack, or null if
 * needle is not part of haystack.
 */

publicclassImplementStrStr {
publicStringstrStr(Stringhaystack, Stringneedle) {
inti = 0;
intlen1 = haystack.length();
intlen2 = needle.length();
if (len1 == 0 && len2 == 0)
return"";
for (; i < len1; i++) {
inta = i;
intb = 0;
booleanmatch = true;
while (b < len2) {
if (a >= len1 || haystack.charAt(a) != needle.charAt(b)) {
match = false;
break;
 } else {
a++;
b++;
 }
 }
if (match)
returnhaystack.substring(i);
 }
returnnull;
	}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35


/**
 * Implement strStr().
 *
 * Returns a pointer to the first occurrence of needle in haystack, or null if
 * needle is not part of haystack.
 */

publicclassImplementStrStr {
publicStringstrStr(Stringhaystack, Stringneedle) {
inti = 0;
intlen1 = haystack.length();
intlen2 = needle.length();
if (len1 == 0 && len2 == 0)
return"";
for (; i < len1; i++) {
inta = i;
intb = 0;
booleanmatch = true;
while (b < len2) {
if (a >= len1 || haystack.charAt(a) != needle.charAt(b)) {
match = false;
break;
 } else {
a++;
b++;
 }
 }
if (match)
returnhaystack.substring(i);
 }
returnnull;
	}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35


/**
 * Implement strStr().
 *
 * Returns a pointer to the first occurrence of needle in haystack, or null if
 * needle is not part of haystack.
 */

publicclassImplementStrStr {
publicStringstrStr(Stringhaystack, Stringneedle) {
inti = 0;
intlen1 = haystack.length();
intlen2 = needle.length();
if (len1 == 0 && len2 == 0)
return"";
for (; i < len1; i++) {
inta = i;
intb = 0;
booleanmatch = true;
while (b < len2) {
if (a >= len1 || haystack.charAt(a) != needle.charAt(b)) {
match = false;
break;
 } else {
a++;
b++;
 }
 }
if (match)
returnhaystack.substring(i);
 }
returnnull;
	}
}