1. java String中hashcode计算公式:
h(s)=s[0]*31^(n-1) + s[1]*31^(n-2) + ... + s[n-1]
为什么取31?
31是odd prime number,不取偶数,因为一个数乘以2相当于移位操作,如有溢出会导致information lost
31*i = (32 - 1)*i = i << 5 - ii,乘法操作快
-> http://stackoverflow.com/questions/299304/why-does-javas-hashcode-in-string-use-31-as-a-multiplier
2. override equal时 也要override hashcode
e.g. 用map,定义如果key相等则object相等
-> http://stackoverflow.com/questions/2265503/why-do-i-need-to-override-the-equals-and-hashcode-methods-in-java