拉链法解决hashtable冲突问题

class HashNode{
  public $key;
  public $value;
  public $nextNode;
  public function __construct($key, $value, $nextNode=Null){
    $this->key = $key;
    $this->value = $value;
    $this->nextNode = $nextNode;
  }
}
class HashTable{
	private $arr;
	private $size=10;
	public function __construct(){
		$this->arr = new SplFixedArray($this->size);
	}

	public function SimpleHash($key){
		$ascTotal=0;
		$strlen = strlen($key);
		for($i=0;$i<$strlen;$i++){
			$ascTotal+=ord($key[$i]);
		}
		return $ascTotal%$this->size;
	}
	//使用拉链法
	//将最新的放在前面
	public function set($key,$val){
		$hash = $this->SimpleHash($key);
		if(isset($this->arr[$hash])){
			$newNode = new HashNode($key,$val,$this->arr[$hash]);
		}else{
			$newNode= new HashNode($key,$val,null);
		}
		$this->arr[$hash] = $newNode;
		return true;
	}

	public function get($key){
		$hash = $this->SimpleHash($key);
		$current = $this->arr[$hash];
		while(!empty($current)){
			if($current->key == $key ){
				return $current->value;
			}
			$current = $current->nextNode;	
		}	
		return NULL;
	}
	public function getList(){
		return $this->arr;
	}
}
$newArr = new HashTable();
for($i=0;$i<25;$i++){
	$key = ‘key‘.$i;
	$newArr->set($key,$i);
}
$arr = $newArr->getList();
print_r($arr);