TopCoder 350 points 21-SRM 154 DIV 1 105/350 30%
2013-06-06 16:15
204 查看
这首题其实就是用到了KMP算法。Problem Statement | ||||||||||||
| Checking to to see if a player enters a valid cheat code in a game is not just a simple matter of checking that the keypresses exactly line up with the cheat code. It is possible that the player may hold down one key a little too long and consequently it is read as two or more key presses. Ignoring repeated key presses isn't an option either however, because a cheat code may require a key to be used repeatedly. Also, the player may press any number of keys before or after entering the cheat code. You will be given a String keyPresses which will contain the keys the player pressed. Each character in keyPresses will correspond to one key pressed by the player. The order of characters in keyPresses is the order in which the keys were entered. You will also be given a String[] codes. Each String in codes will be one possible valid cheat code. You are to create a class CheatCode with a method matches which will return a sorted int[] containing the indexes of all codes in codes which potentially match what the player entered. A cheat code matches keyPresses if some substring of keyPresses is the same as the cheat code, except that it may have more than one of the same character, where only one was expected. So, if keyPresses where "ABBCC", it would match the cheat codes "ABC", "BB" and "BC" (and others), but not "ABBB" or "BBCCD". For example, if keyPresses is "UUDDLRRLLRBASS" (quotes for clarity) and codes is { "UUDDLRLRBA",
"UUDUDLRLRABABSS",
"DDUURLRLAB",
"UUDDLRLRBASS",
"UDLRRLLRBASS" }The code "UUDDLRLRBA" matches because the player may enter extra keys after the code has been entered. Also notice that although there is an extra 'R' and 'L' in the middle of keyPresses, the code still matches because the computer may have accidentally detected repeated keys while the player entering a code. The code "UUDUDLRLRABABSS" stops matching at the 4th character, 'U'. The 2nd 'D' in keyPresses is allowed because the player may have held it down too long. However, the 'U' does not match the 'L', which is next in keyPresses. The code "DDUURLRLAB" does not match. Remember though that the beginning of keyPresses, "UU", is ignored here because the player may have done another move before entering the code. The "DD" at the beginning of the code does match with the first "DD" in keyPresses, however next in keyPresses is an 'L' which does not match the 'U' in the code. The code "UUDDLRLRBASS" matches. The code "UDLRRLLRBASS" also matches. Your program would return { 0, 3, 4 }for the 0th, 3rd, and 4th codes in codes which match keyPresses. | ||||||||||||
Definition | ||||||||||||
| ||||||||||||
Constraints | ||||||||||||
| - | keyPresses will be between 0 and 50 characters in length, inclusive. | |||||||||||
| - | keyPresses will only contain uppercase letters ('A'-'Z'). | |||||||||||
| - | codes will contain between 0 and 50 elements, inclusive. | |||||||||||
| - | Each String in codes will be between 1 and 50 characters in length, inclusive. | |||||||||||
| - | Each String in codes will only contain uppercase letters ('A'-'Z'). | |||||||||||
Examples | ||||||||||||
| 0) | ||||||||||||
| ||||||||||||
| 1) | ||||||||||||
| ||||||||||||
| 2) | ||||||||||||
| ||||||||||||
| 3) | ||||||||||||
| ||||||||||||
| 4) | ||||||||||||
|
import java.util.ArrayList;
public class CheatCode {
public int[] matches(String keyPresses, String[] codes) {
ArrayList<Integer> list = new ArrayList<Integer>();
int len = codes.length;
int tLength = keyPresses.length();
char[] tArray = keyPresses.toCharArray();
int m = tArray.length;
if (keyPresses.equals("") || len == 0)
return new int[0];
for (int i = 0; i < len; i++) {
int nextArray[] = next(codes[i]);
boolean isCheat = false;
boolean isRepeated = false;
String p = codes[i];
char[] pArray = p.toCharArray();
int len_code = pArray.length;
if (m < len_code)
continue;
int q = 0;
for (int j = 0; j < tLength; j++) {
while (q > 0 && tArray[j] != pArray[q]) {
if (j > 0 && tArray[j] == tArray[j - 1]) {
isRepeated = true;
break;
} else
isRepeated = false;
q = nextArray[q - 1];
}
if (tArray[j] == pArray[q]) {
if (isRepeated)
isRepeated = false;
q++;
}
if (isRepeated)
continue;
if (q == len_code) {
isCheat = true;
break;
}
}
if (isCheat) {
list.add(i);
continue;
}
}
int lenList = list.size();
if (lenList > 0) {
int r[] = new int[lenList];
for (int i = 0; i < lenList; i++)
r[i] = list.get(i);
return r;
} else {
return new int[0];
}
}
private int[] next(String s) {
char arr[] = s.toCharArray();
int length = arr.length;
int t[] = new int[length];
if (length == 0)
return t;
t[0] = 0;
int k = 0;
for (int q = 1; q < length; q++) {
while (k > 0 && arr[k] != arr[q])
k = t[k - 1];
if (arr[k] == arr[q])
k++;
t[q] = k;
}
return t;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- TopCoder 350 points 7-SRM 147 DIV 1 105/350 30%
- TopCoder 350 points 22-SRM 154 DIV 2 246.20/300 82.07%
- TopCoder 300 points 27-SRM 157 DIV 1 90/300 30%
- TopCoder 300 points 24-SRM 155 DIV 2 75/250 30%
- TopCoder 300 points 1-SRM 144 DIV 1 90/300 30%
- TopCoder 250 points 16-SRM 151 DIV 2 97.63/250 39.05%
- TopCoder 200 points 2-SRM 144 DIV 2 152.06/200 76.03%
- TopCoder 250 points 3-SRM 145 DIV 1 84.71/250 33.88%
- TopCoder 250 points 4-SRM 145 DIV 2 128.72/250 51.49%
- TopCoder 300 points 26-SRM 156 DIV 2 78.06/300 26.02%
- TopCoder 250 points 28-SRM 157 DIV 2 185.60/250 74.24%
- topcoder srm 350 div1
- TopCoder 300 points 5-SRM 146 DIV 1 109.50/300 36.5%
- TopCoder 250 points 13-SRM 150 DIV 1 82.63/250 33.05%
- TopCoder 250 points 6-SRM 146 DIV 2 162.67/250 65.07%
- TopCoder 250 points 17-SRM 152 DIV 1 106.51/250 42.60%
- TopCoder 250 points 18-SRM 152 DIV 2 167.05/250 66.82%
- TopCoder 250 points 9-SRM 148 DIV 1 75/250 30%
- TopCoder 250 points 19-SRM 153 DIV 1 84.72/250 33.89%
- TopCoder 250 points 8-SRM 147 DIV 2 176.36/250 70.54%