当年奥本是如何被忽悠在新财年开始时就按每个季度分配SO的？# EB23 - 劳工卡
r*g
1 楼
I saw this on careerup, not sure how to solve them. Thank you.
1, realize malloc() in C
What is key data structure here? What is the key point?
2 If [a1,a2,a3...,an,b1,b2...bn] is given input change this to [a1,b1,a2,b2.
....an,bn] , solution should be in-place
Anyone knows what is the most efficient solution? It is best if there is a
link provided.
3, Given an array of +ve and -ve integers, re-arrange it so that u have +ves
on one end and -ves on other,BUT RETAIN ORDER OF APPEARANCE..
for eg,
1,7,-5,9,-12,15
ans=
-5,-12,1,7,9,15
do it in O(n) without using any extra space.
I doubt it can be realized without extra space. Is there a solution using
constant space?
Surely linked list is a solution, what else can we get?
Thanks.
1, realize malloc() in C
What is key data structure here? What is the key point?
2 If [a1,a2,a3...,an,b1,b2...bn] is given input change this to [a1,b1,a2,b2.
....an,bn] , solution should be in-place
Anyone knows what is the most efficient solution? It is best if there is a
link provided.
3, Given an array of +ve and -ve integers, re-arrange it so that u have +ves
on one end and -ves on other,BUT RETAIN ORDER OF APPEARANCE..
for eg,
1,7,-5,9,-12,15
ans=
-5,-12,1,7,9,15
do it in O(n) without using any extra space.
I doubt it can be realized without extra space. Is there a solution using
constant space?
Surely linked list is a solution, what else can we get?
Thanks.
