fang-l10
BAN USER/**
* @Description: random number generator
* @param seed
* @param num how many numbers to generator
*/
static void randomGenerator(int seed, int num) {
while (num-- > 0) {
String md5 = getMD5(String.valueOf(seed));
int random = 0;
for (int i = 0; i < md5.length(); i++)
random += md5.charAt(i) - 'A';
System.out.println(random);
seed++;
}
}
/**
* @Description: generate md5
* @param input
* @return
*/
static String getMD5(String input) {
try {
MessageDigest md = MessageDigest.getInstance("MD5");
byte[] messageDigest = md.digest(input.getBytes());
BigInteger number = new BigInteger(1, messageDigest);
String hashtext = number.toString(16);
return hashtext;
} catch (NoSuchAlgorithmException e) {
throw new RuntimeException(e);
}
}
- fang-l10 June 12, 2014public static List<String> generateString(char[] inputString, int startIndex) {
List<String> result = new ArrayList<String>();
StringBuilder sb = new StringBuilder();
boolean addlast = true;
for (int i = startIndex; i < inputString.length; i++) {
if (inputString[i] != '?')
sb.append(inputString[i]);
else {
List<String> otherResult = generateString(inputString, i + 1);
for (String otherStr : otherResult) {
result.add(sb.toString() + "0" + otherStr);
result.add(sb.toString() + "1" + otherStr);
}
addlast = false;
break;
}
}
if (addlast)
result.add(sb.toString());
return result;
}
public static void main(String[] args) {
char[] test = "?a?b??".toCharArray();
for (String str : generateString(test, 0))
System.out.println(str);
}
- fang-l10 June 12, 2014public static String trimSpace(String input) {
char[] charsInString = input.toCharArray();
StringBuilder sb = new StringBuilder();
for (int i = 0; i < charsInString.length; i++) {
char c = charsInString[i];
if (c == ' ') {
if (i != 0)
sb.append(c);
while (i < charsInString.length - 1
&& charsInString[i + 1] == ' ')
i++;
} else
sb.append(c);
}
if (sb.charAt(sb.length() - 1) == ' ')
sb.deleteCharAt(sb.length() - 1);
return sb.toString();
}
- fang-l10 June 12, 2014public static int countWordsInMatrix(char[][] matrix, char[] inputString) {
int col = matrix[0].length;
int row = matrix.length;
int count = 0;
for (int i = 0; i < row - 1; i++) {
for (int j = 0; j < col - 1; j++) {
int find = search(matrix, row, col, i, j, inputString, 0);
count += find;
}
}
return count;
}
public static int search(char[][] matrix, int row, int col, int i, int j,
char[] inputString, int matchIndex) {
if (matchIndex == inputString.length)
return 1;
if (matrix[i][j] != inputString[matchIndex])
return 0;
else {
int count = 0;
if (i + 1 < row)
count += search(matrix, row, col, i + 1, j, inputString,
matchIndex + 1);
if (j + 1 < col)
count += search(matrix, row, col, i, j + 1, inputString,
matchIndex + 1);
if (i > 1)
count += search(matrix, row, col, i - 1, j, inputString,
matchIndex + 1);
if (j > 1)
count += search(matrix, row, col, i, j - 1, inputString,
matchIndex + 1);
return count;
}
}
- fang-l10 June 12, 2014
em, what is O and p ?
- fang-l10 June 23, 2014