|
|
|
|
|
|
|
r********i
发帖数: 5358 | 8 from 35205, FBA, billpay, pm please. |
|
|
|
|
|
|
|
|
|
|
|
|
r********i
发帖数: 5358 | 20 from 35205, FBA, billpay, pm please. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
c*******1
发帖数: 2856 | 40 please pm, one label ready |
|
|
|
|
x****x
发帖数: 262 | 44 Enjoy a large open floor plan, large windows, large deck, great closets,
gourmet kitchen, separate dining area, large living room, cozy fireplace,
and extra storage off the deck. The nice den with a closet can be used as a
third bedroom. Sammamish Hills, a nice, quiet, and professional community,
is a good place to rest after work. With seconds to I90 Exit 13, close to
public transportation, it is convenient to travel to downtown Seattle,
Bellevue, Microsoft, Airport, and many shopping centers.
... 阅读全帖 |
|
b*****m
发帖数: 160 | 45 房子从6月1号到7月9号available。
地点：cross streat of 39th ave & 30th st, long island city, NY, 1101
步行一分钟到N车39th ave, 到Mahattan只有两站，8分钟。
房租600/month，或者200/week。
两室一厅一卫的房间，与本人合租。本人朝九晚五码农一名，无不良习惯。安静，无烟
，卫生。
房间宽敞，两扇大窗，附近各种设施齐全，停车方便。
有意者站内，或者电话/短信 917-250-6152。 |
|
s****a
发帖数: 6521 | 46
SP BlkRk Hlth Scnc Oppr Inv A % 1795 MC LeggM Oppr Tr Inst % 1528
SP Invsco RealEst A % 576 LC AmFds Gr Fd Am R3 % 662
SP Opp Gold Spec Mnrls A % 374 LC Davis Oppr A % 473
SP Prudntl Jnisn Natrl Rsrc A % 383 LC Drey Strat Val A % 722
SP RydexSGI Bio Adv % 516 LC LeggM ClrBrdg Aggr Gr A % 397
IS AmFds CapWld Gr Inc R3 % 388 LC LeggM ClrBrdg Val Tr I % 1144
IS FnklnTmp Devl Mkt Tr A % 981 LC NeuBer LgCp Val Tr % 410
IS Opp Devl Mkt A % 844 LC Op... 阅读全帖 |
|
s****a
发帖数: 6521 | 47
SP BlkRk Hlth Scnc Oppr Inv A % 1795 MC LeggM Oppr Tr Inst % 1528
SP Invsco RealEst A % 576 LC AmFds Gr Fd Am R3 % 662
SP Opp Gold Spec Mnrls A % 374 LC Davis Oppr A % 473
SP Prudntl Jnisn Natrl Rsrc A % 383 LC Drey Strat Val A % 722
SP RydexSGI Bio Adv % 516 LC LeggM ClrBrdg Aggr Gr A % 397
IS AmFds CapWld Gr Inc R3 % 388 LC LeggM ClrBrdg Val Tr I % 1144
IS FnklnTmp Devl Mkt Tr A % 981 LC NeuBer LgCp Val Tr % 410
IS Opp Devl Mkt A % 844 LC Op... 阅读全帖 |
|
l*******r
发帖数: 511 | 48 given a 32 bit number N and 2 numbers(A & B) that determine 2 different bit
pos
itions of N how do you make all the bits between A and B equal to another
given
integer k.
given (A,B is in the range [0 to 31] and
k<=2^(B-A+1) ( so that k fits between B-A+1 bits). Give an O(1) solution for
th
is
e.g if N=9 ( 1001) ,A=0 ,B=2,K=5(101 then the result should be 1101 (1.e 13)
这个题是什么意思啊？ |
|
s**9
发帖数: 207 | 49 DP可以这样解：
Let M(i) be the solution to d_1,...,d_i
Let w(i,j) be the weight of d_id_{i+1} or d_id_{i+1}d_{i+2}
M(i)=max{M(i-1), M(i-2)+w(i-1,i), M(i-3)+w(i-2,i)}
Greedy应该不行，因为M(i-3)+w(i-2,i) 可以比 M(i-1)大可以比M(i-1)小,例如1101和
0101的情况。
不知道分析的对不
,
030 |
|
H***e
发帖数: 476 | 50 来自主题: JobHunting版 - 问个算法题 假设N用二进制表示为 1101 ， 一共有m 位,ie 4，
可以考虑一个虚拟的二进制树，不用建树，所以不会增加复杂度
因为这个树一定是binary的，并且是 complete tree（ heap 的那种结构 ，只有最后
的leaf可能有gap)
定义full tree为完树，也就是总共有2^n + 1的那种
先算一下所有以0为root的full tree的中1的个数，
f(k) = 2f(k-1) + 1 and f(2) = 1 f(1) =0
比如: full tree:
0
0 1
0 1 0 1
f(3) = 3
接着， 对N的二进制(1100)表示进行处理，从最高位开始，如果是0什么都不做，进入
下一位， 如果是1，则以为着有一个full tree的以0为root的存在，在sum = sum + f(
4) + 1 (此位) ，然后进入下一位。
这里为1，意味着有0为root的full tree存在 sum=sum+f(3)+1
再下一位0,什么都不做，进入下... 阅读全帖 |
|
