s[0]*31^ (n-1) + s[1]*31^ (n-2) +. + s[n-1] Use this algorithm to do hash

s[0]*31^ (n-1) + s[1]*31^ (n-2) + ... + s[n-1] hash with this algorithm
s[0]*31^ (n-1) + s[1]*31^ (n-2) + ... + s[n-1] hash with this algorithm

What do you think?

How to detect conflicts?

When I'm a fixed-length string, say 10 characters,

What is the conflict situation?

It is said that this algorithm is in Java hashcode do not know, is not it? I'm going to send the Java version.

------Solution--------------------
Hash conflicts of massive data are inevitable, usually in the case of conflicts, using sequential list
If you do not reserve storage space for conflicts, there is probably no solution

