android能用otg连usb printer么?# PDA - 掌中宝h*a2012-09-13 07:091 楼比如说,一篇novel,如何group anagram: stop, post, spot....要是用stl map的话,算法复杂度是多少?是对每个word先排序吧,想不太明白。谢谢!
g*e2012-09-13 07:093 楼compute the signature for every word and store it in a hashmap. stop =o1p1s1t1O(n) time【在 h****a 的大作中提到】: 比如说,一篇novel,如何group anagram: stop, post, spot....: 要是用stl map的话,算法复杂度是多少?是对每个word先排序吧,: 想不太明白。: 谢谢!
h*a2012-09-13 07:095 楼n是指的单词数还是字符数?【在 g**e 的大作中提到】: compute the signature for every word and store it in a hashmap. stop =: o1p1s1t1: O(n) time