我想設置一個二進制搜索程序,使用字符串而不是整數。問題是我不知道如何創建一個小於一個字符串值的數組。如何找到一個小於另一個元素的元素?
例如
字符串數組小於字符串值。
/**
The StringBinarySearcher class provides a public static
method for performing a binary search on an String array.
*/
public class StringBinarySearcher
{
/**
The search method performs a binary search on an String
array. The array is searched for the number passed to
value. If the number is found, its array subscript is
returned. Otherwise, -1 is returned indicating the
value was not found in the array.
@param numbers The array to search.
@param value The value to search for.
*/
public static int search(String[] numbers, String value)
{
int first; // First array element
int last; // Last array element
int middle; // Mid point of search
int position; // Position of search value
boolean found; // Flag
// Set the inital values.
first = 0;
last = numbers.length - 1;
position = -1;
found = false;
// Search for the value.
while (!found && first <= last)
{
// Calculate mid point
middle = (first + last)/2;
// If value is found at midpoint...
if (numbers[middle] == value)
{
found = true;
position = middle;
}
// else if value is in lower half...
// needs array to be less then the string value?, without using equality regulators
else if (numbers[middle].compareTo(numbers[middle +1]) > 0)
last = middle - 1;
// else if value is in upper half....
else
first = middle + 1;
}
// Return the position of the item, or -1
// if it was not found.
return position;
}
}
爲什麼你認爲你需要一個數組數組來對你的字符串數組進行二分搜索? – 2011-03-17 01:33:09
順便說一句,'如果(數字[中] ==值)'是錯誤的比較,使用'如果(數字[中] .equals(價值))' – MByD 2011-03-17 01:34:42
可以排序字符串數字,與整數? – user663428 2011-03-17 01:36:03