【第三轮】6.30-7.6 CareerCup 3.5

qianhuang 发表于 2014-7-2 21:23
thank you for review.
PS: 怎么点评别人的帖子？我找不到这功能？

要攒够1000分升到高级农民才可以…我也是最近才发现
话说很少人用c++刷题呐 握爪

【解题思路】
用两个stack，一个专门入队，一个专门出队
【时间复杂度】
O(1)
【空间复杂度】
O(n)
【gist link】
https://gist.github.com/JoyceeLee/4cd3b04782250d47aa69

【解题思路】
one stack for enqueue, the second stack for dequeue;  if the second stack is empty, pop all elements in the first stack and push to the second one.
【时间复杂度】
O(1)
【空间复杂度】
O(n)
【gist link】https://gist.github.com/jyhjuzi/0768b50cf97db7914564

【解题思路】
Use one stack as the 'push' stack and another as the 'pop' stack. Push all elements to the push stack, and pop from the pop stack. When the pop stack is empty, push all elements from the push stack to the pop stack

【时间复杂度】
POP: amortized O(1), worst case O(n), Push is O(1)

【空间复杂度】
O(n)

【gist link】
https://gist.github.com/XiaoxiaoLi/fb712533a48d73b4415f

【解题思路】2 stacks, 1 for insert, another for deque
【时间复杂度】O(1)
【空间复杂度】O(n)
【gist link】https://gist.github.com/bitcpf/36f4295d5b02d9b14d75

【解题思路】2 stacks, enqueue & dequeue
【时间复杂度】O(1)
【空间复杂度】O(n)
【gist link】
https://github.com/donnice/donni ... 076dfe699d3994b4cf6

【解题思路】
two stacks, one for enqueque, one for dequeue
【时间复杂度】
O(1)
【空间复杂度】
O(n)
【gist link】https://gist.github.com/yokiy/6e167df8c936e92241d9

【解题思路】one stack for push, one stack for poll
【时间复杂度】O(1) for push; O(n) for poll, depends on the order of operations
【空间复杂度】O(n)
【gist link】https://gist.github.com/nealhu/bdcb03625883ae62f023

【解题思路】
Create two stacks, stackNewest and stackOldest.
Push elements into stackNewest and pop elements
from stackOldest. If stackOldest is empty when
trying to pop, pop elements from stackNewest and
push into stackOldest.
【时间复杂度】      
enQueue  deQueue
O(1)     O(N)
【空间复杂度】O(N)
【gist link】https://gist.github.com/JoshuaTang/b0b386c99fa59f665c8a