b********e
发帖数: 693 | 1 without using any space
the time complex is O(N), and space is O(1)
how to do it? |
K******g
发帖数: 1870 | 2 hash，the space is still O(1).
【在 b********e 的大作中提到】
: without using any space
: the time complex is O(N), and space is O(1)
: how to do it?
|
b********e
发帖数: 693 | 3 based on one guy's interview, Amazon denied the hash solution.
any other solution?
【在 K******g 的大作中提到】
: hash，the space is still O(1).
|
d**e
发帖数: 6098 | 4 可不可以说说hash怎么做？谢谢
【在 b********e 的大作中提到】
: based on one guy's interview, Amazon denied the hash solution.
: any other solution?
|
f*********5
发帖数: 576 | 5 can below be considered as O(1) space?
char array or bitmap which can support 256 different situations?
【在 b********e 的大作中提到】
: without using any space
: the time complex is O(N), and space is O(1)
: how to do it?
|
