search

billryan / algorithm-exercise

Data Structure and Algorithm notes. 数据结构与算法/leetcode/lintcode题解/
https://algorithm.yuanbin.me
3.44k stars 892 forks source link

Update two_strings_are_anagrams.md #40

Closed wenalan closed 8 years ago

wenalan commented 8 years ago

遍历两次数组，时间复杂度还是O(n) 空间复杂度任何情况下都是256，所以是O(1)

billryan commented 8 years ago

严格一点的话你的写法更严谨。