w**********4
发帖数: 157 | 1 也写一下最近面的bloomberg 的面经。
总共两次phone interview 每次两个题目。
第一次phone interview
第一题 max stack ： 这个是 leetcode 上 min stack 的原题，只是 getMin
改成getMax
第二题 输入 一个String s 在 s 后添加最少的 String s' 得到 新的
String T 是一个 palindromic。
第二次phone interview
第一题 input array of number {1,2,3,4,5,6} return number of array {2
*3*4*5*6, 1*3*4*5*6,1*2*4*5*6,1*2*3*5*6,1*2*3*4*6,1*2*3*4*5 }, 要求 不允许用
除法。
my soluction :
publicList getResult(int[] num) {
List res = new ArrayLis... 阅读全帖 |
|
g****y
发帖数: 212 | 2
You don't need installshield.
Just add a setup project in your current soluction and add the project output.
Very easy.just try it. |
|
t****s
发帖数: 141 | 3 Use www.google.com search Jbutton, toggle button and I got this
http://java.sun.com/products/jlf/dg/higq.htm
toggle button
A button that alternates between two states. For example, a user
might click one toggle button in a toolbar to turn italics on and
off. A single toggle button has checkbox behavior; a programmatically
grouped set of toggle buttons can be given the mutually exclusive
behavior of radio buttons. Toggle buttons are created using the
JToggleButton component. See also toolbar butt |
|
b***e
发帖数: 1419 | 4 The trick for this question is use a variable-based radix sort.
In normal radix sort, the bases are fixed. This time use the
variable "n" as the sorting base. Concete soluction is as follows:
Rewrite each number in the representation of (x / n, x % n), where
the "/" represents integeral division, and "%" represents integeral
modulo, as in C. You can first use counting sort to sort the second
elements of all the pairs , and then sort the first element. This
takes O(n) time. |
|
