One Microsoft interview question# JobHunting - 待字闺中
s*n
1 楼
Question:
Give an array like [-128, -35, -13, 0, 12, 67, 98], find two element which
the sum is
closest to 0.
solution:
http://www.careertea.com/techforum/post.aspx?PostID=5095
Give an array like [-128, -35, -13, 0, 12, 67, 98], find two element which
the sum is
closest to 0.
solution:
http://www.careertea.com/techforum/post.aspx?PostID=5095