[第二轮] 2/18-2/24 CareerCup 1.3

看了1.1大家的解答之后学会了用bitmap

https://github.com/ltongrc/CareerCup/blob/master/1.3.java

https://gist.github.com/bigteeth/5010720

the same idea used in the first question. this reminds me of another question related to this.  find all the permutations of given string. anyone interested?

https://gist.github.com/ThunderXu/5017976
创建一个256大小的int数组，初始化为0，对第一个string的每个char在数组中对应的位置+1，对第二个string的每个char在数组中对应的位置-1，最后再判断数组中是否都为0。
缺点是只能兼容那256个ASCII码。
有个问题：如果这个string包含中文该怎么办？因为中文会占两个ASCII吗，所以只是换成hashmap好像还会出问题吧

Assume all characters are in 8-bit ASCII table.
Use the idea of bitmap.

https://gist.github.com/Andy1989/c5a2a7fce9a01ef823b9

https://gist.github.com/sjtuzyt/5028964
bitmap

https://gist.github.com/yzl232/5035366

运用了2楼的算法。 冒泡排序后比较。 语言用了Python



我觉得27楼的真好。。

https://gist.github.com/flatlight/5056304
真正面试时候是不是不能借助hashtable, hashset。而是自己用数组模拟？

this is my solution

https://gist.github.com/ShaneLittleton/5070038

https://gist.github.com/mogutou1214/5589307
my solution.