java学习第42天，哈希表

1. 神奇、实用、粗暴的方法. 空间换时间。
2. 在构造方法中装入数据. 自己可以写代码增加数据。
3. 使用 (最简单的) 除数取余法获得数据存放地址 (下标)。
4. 使用 (最简单的) 顺移位置法解决冲突
5. 搜索的时间复杂度仅与冲突概率相关, 间接地就与装填因子相关. 如果空间很多, 可以看出时间复杂度为 O (1) O(1)O(1)。

需要用到41天的代码，并且予以增加部分代码：

package java41to50;

public class D41_DataArray {
	class DataNode {
		int key;
		String content;

		DataNode(int paraKey, String paraContent) {
			key = paraKey;
			content = paraContent;
		}

		public String toString() {
			return "(" + key + ", " + content + ") ";
		}
	}

	DataNode[] data;
	int length;

	public static void main(String[] args) {
		System.out.println("\r\n-------顺序搜索测试-------");
		sequentialSearchTest();
		System.out.println("\r\n-------二进制搜索测试-------");
		binarySearchTest();
	}

	public D41_DataArray(int[] keyArray, String[] contentArray) {
		length = keyArray.length;
		data = new DataNode[length];
		for (int i = 0; i < length; i++) {
			data[i] = new DataNode(keyArray[i], contentArray[i]);
		}
	}

	public D41_DataArray(int[] paraKeyArray, String[] paraContentArray, int paraLength) {
		length = paraLength;
		data = new DataNode[length];
		for (int i = 0; i < length; i++) {
			data[i] = null;
		}
		int tempPosition;
		for (int i = 0; i < paraKeyArray.length; i++) {
			tempPosition = paraKeyArray[i] % paraLength;
			while (data[tempPosition] != null) {
				tempPosition = (tempPosition + 1) % paraLength;
				System.out.println("碰撞，向前移动 " + paraKeyArray[i]);
			}
			data[tempPosition] = new DataNode(paraKeyArray[i], paraContentArray[i]);
		}
	}

	public String hashSearch(int paraKey) {
		int tempPosition = paraKey % length;
		while (data[tempPosition] != null) {
			if (data[tempPosition].key == paraKey) {
				return data[tempPosition].content;
			}
			System.out.println("Not this one for " + paraKey);
			tempPosition = (tempPosition + 1) % length;
		}
		return "null";
	}

	public static void hashSearchTest() {
		int[] tempUnsortedKeys = { 16, 33, 38, 69, 57, 95, 86 };
		String[] tempContents = { "if", "then", "else", "switch", "case", "for", "while" };
		D41_DataArray tempDataArray = new D41_DataArray(tempUnsortedKeys, tempContents, 19);
		System.out.println(tempDataArray);
		System.out.println("Search result of 95 is: " + tempDataArray.hashSearch(95));
		System.out.println("Search result of 38 is: " + tempDataArray.hashSearch(38));
		System.out.println("Search result of 57 is: " + tempDataArray.hashSearch(57));
		System.out.println("Search result of 4 is: " + tempDataArray.hashSearch(4));
	}

	public String toString() {
		String resultString = "数据数组的项目个数：" + length + " .\r\n";
		for (int i = 0; i < length; i++) {
			resultString += data[i] + " ";
		}
		return resultString;
	}

	public String sequentialSearch(int key) {
		data[0].key = key;
		int i;
		for (i = length - 1; data[i].key != key; i--) {
			;
		}
		return data[i].content;
	}

	public static void sequentialSearchTest() {
		int[] unsortedKeys = { -1, 5, 3, 6, 10, 7, 1, 9 };
		String[] contents = { "null", "if", "then", "else", "switch", "case", "for", "while" };
		D41_DataArray dataArray = new D41_DataArray(unsortedKeys, contents);
		System.out.println(dataArray);
		System.out.println("Search result of 10 is: " + dataArray.sequentialSearch(10));
		System.out.println("Search result of 5 is: " + dataArray.sequentialSearch(5));
		System.out.println("Search result of 4 is: " + dataArray.sequentialSearch(4));
	}

	public String binarySearch(int key) {
		int left = 0;
		int right = length - 1;
		int middle = (left + right) / 2;

		while (left <= right) {
			middle = (left + right) / 2;
			if (data[middle].key == key) {
				return data[middle].content;
			} else if (data[middle].key <= key) {
				left = middle + 1;
			} else {
				right = middle - 1;
			}
		}
		return "null";
	}

	public static void binarySearchTest() {
		int[] sortedKeys = { 1, 3, 5, 6, 7, 9, 10 };
		String[] contents = { "if", "then", "else", "switch", "case", "for", "while" };
		D41_DataArray dataArray = new D41_DataArray(sortedKeys, contents);
		System.out.println(dataArray);
		System.out.println("Search result of 10 is: " + dataArray.binarySearch(10));
		System.out.println("Search result of 5 is: " + dataArray.binarySearch(5));
		System.out.println("Search result of 4 is: " + dataArray.binarySearch(4));
	}
}

第42的哈希搜索代码：

package java41to50;

public class D42_HashSearch {
	public static void main(String[] args) {
		System.out.println("\r\n-------顺序搜索测试-------");
		D41_DataArray.sequentialSearchTest();
		System.out.println("\r\n-------二进制搜索测试-------");
		D41_DataArray.binarySearchTest();
		System.out.println("\r\n-------哈希搜索测试-------");
		D41_DataArray.hashSearchTest();
	}
}

结果输出：

-------顺序搜索测试-------
数据数组的项目个数：8 .
(-1, null)  (5, if)  (3, then)  (6, else)  (10, switch)  (7, case)  (1, for)  (9, while)  
Search result of 10 is: switch
Search result of 5 is: if
Search result of 4 is: null

-------二进制搜索测试-------
数据数组的项目个数：7 .
(1, if)  (3, then)  (5, else)  (6, switch)  (7, case)  (9, for)  (10, while)  
Search result of 10 is: while
Search result of 5 is: else
Search result of 4 is: null

-------哈希搜索测试-------
碰撞，向前移动 57
碰撞，向前移动 95
碰撞，向前移动 95
数据数组的项目个数：19 .
(38, else)  (57, case)  (95, for)  null null null null null null null (86, while)  null (69, switch)  null (33, then)  null (16, if)  null null 
Not this one for 95
Not this one for 95
Search result of 95 is: for
Search result of 38 is: else
Not this one for 57
Search result of 57 is: case
Search result of 4 is: null