[Quote=引用 1 楼 qiuzhenguang 的回复:]
Use hash table to detect if there is repeated characters,When hash collision occurs,there must be characteres that is not unique.
The time complicity and space complexity are both O(n).
[/Quote]
Use hash table to detect if there is repeated characters,When hash collision occurs,there must be characteres that is not unique.
The time complicity and space complexity are both O(n).