L******k
发帖数: 33825 | 1 【 以下文字转载自 Education 讨论区 】
发信人: LXJSmonk (紫色心情的 LXJS NYC_monk), 信区: Education
标 题: NYC Ladders for Leaders 2010 Application Now
发信站: BBS 未名空间站 (Tue Nov 24 15:16:39 2009, 美东)
The application for the 2010 NYC Ladders for Leaders summer internship progr
am is now available online. Below is the link to the online application. The
deadline for students to apply is December 14, 2009. Please forward to your
friends and spread the word throughout your schools. Also, please be remind
ed that alumni of th |
|
W**T
发帖数: 18996 | 2 对了， 记得填写自己的ID 不是名字。
登陆-》ladder -》 加入 酱油 ladder 就可以了。 |
|
a*m
发帖数: 6253 | 3 https://www.google.com/webhp?sourceid=chrome-instant&ion=1&ie=UTF-8#hl=en&gs
_rn=8&gs_ri=psy-ab&gs_mss=%E6%B0%B4%E5%93%81rint&tok=Z1wM3v0R9Mn6H4aixwRDhQ&
cp=13&gs_id=37&xhr=t&q=tennis+ladder&es_nrs=true&pf=p&biw=1280&bih=589&
sclient=psy-ab&oq=tennis+ladder&gs_l=&pbx=1&bav=on.2,or.r_cp.r_qf.&bvm=bv.
44697112,d.cGE&fp=c4e6afb773b4e082&ion=1
关键是promotion和marketing。。。 |
|
z****1
发帖数: 719 | 4 harry 组织jay和几个国内高校的一共10个人，正好周6那天打个single tournament.
NIH和FDA的叫我去了，不过跟我说晚了，harry之前千叮万嘱让我别安排其他事情，哈
哈。
再说德国镇那个我不认为对我会有挑战，呵呵。不过奖杯到是比harry的好。这个
ladder比赛就是在同一地点，不过一个室外，一个室内。打完ladder又去打harry的
tournament. |
|
f*****t
发帖数: 4395 | 5
没啥神秘的，TL和bnet论坛上有个玩家叫ExcaliburZ的文章，详细分析了ladder系统，
升league
有一个threshold, 你的隐藏ladder评分(他们称之为MMR)在超过这个门槛以后，一定数
量的game
之内要保持这个MMR水平就能升级了，
比如你现在MMR有1100,升级的门槛是1000,在接下来的N场游戏里不管输赢只要能保持在
1000以上，
就能晋级了 |
|
x***r
发帖数: 85 | 6 请问一下，谁有制作prestained protein ladder的protocol吗？我们做很多western，
而老板在ladder的花销上很在意，希望能得到一个protocol，多谢！！回复邮件xlxnr@
yahoo.com |
|
x***r
发帖数: 85 | 7 请问一下，谁有制作prestained protein ladder的protocol吗？我们做很多western，
而老板在ladder的花销上很在意，希望能得到一个protocol，多谢！！回复邮件xlxnr@
yahoo.com |
|
L******k
发帖数: 33825 | 8 The application for the 2010 NYC Ladders for Leaders summer internship progr
am is now available online. Below is the link to the online application. The
deadline for students to apply is December 14, 2009. Please forward to your
friends and spread the word throughout your schools. Also, please be remind
ed that alumni of the NYC Ladders for Leaders program (or its parent program
s, NYC GirlsREACH and BoysREACH and CAPITAL) are not eligible to apply for t
he 2010 program.
https://www.nyc.gov/htm |
|
|
w*******y
发帖数: 60932 | 10 Wow, nice deal on a handy 4' aluminum step ladder made by Werner. This is
one of the most perfect sized ladders I've ever used. Stores in the closet
unlike a 6' which hogs up a lot of room.
Info:
Type II
225lb. capacity
Great for painting
Household maintenance
Conveenient tray for tools and Paint
Slip-resistant steps
Sku # 767-133
Enjoy!
|
|
|
w*******y
发帖数: 60932 | 12 I was able to purchase Werner 22' Type IA Aluminum Multi Position Ladder (
300 lb. Capacity) (MT-22)
Home Depot has this in-store for $149.99
Lowes has this for $214.00, but they'll price match + take additional 10%
off.
Stack with $10 off $50 (exp 4/4) coupon and $25 MIR
$214.00 Lowes price
-64.01 Price Match
-14.99 Price match policy (additional 10% off)
- 10.00 ($10 off $50)
- 25.00 Rebate for ladder $99 - $198.99 printed out w/ receipt |
|
w*******y
发帖数: 60932 | 13 I was at Home Depot and these were on display for $79.99. instore YMMV
Aluminum frame provides a strong and sturdy structure
20 steps for convenient access to hard-to-reach places
Holds up to 200 lb. for common household applications
Adjusts from 10 - 20 ft.
Pivoting shoe with slip-resistant pad
Spring-loaded locks work smoothly and secure ladder at each adjustable level
Alflo technology gives a twist-proof performance
Lightweight and easy to use
ANSI certified
MFG Brand Name : Werner
MFG Model ... 阅读全帖 |
|
w*******y
发帖数: 60932 | 14 I've used this ladder for the last two years as a roofing salesman and it's
great....SUPER light weight and easy to use....Dont get this confused with
the cheaper versions sold at costco....This model is lighter and easier to
use.
Link:
http://www.littlegiantoutlet.com/type-1a-revolution-ladder.html
|
|
w*******y
发帖数: 60932 | 15 Home Depot has a 6 foot WERNER ladder for $39.99 right now. Free shipping
via ship to store, B&M availability as well.
-225 lbs. Load Capacity ( Type II Duty Rating )
This isn't as good as a Black Friday deal, but it's a pretty good discount
over MSRP ($59.99) if you need one now! Sale ends 2/11
Werner Ladder at HomeDepot.com:
http://www.homedepot.com/h_d1/N-5yc1v/R-202259337/h_d2/ProductD 6"&storeId=10051
|
|
|
c*****u
发帖数: 1826 | 17 【 以下文字转载自 Badminton 讨论区 】
发信人: cuteniu (妞儿), 信区: Badminton
标 题: 一个 XY 互挑Ladder Proposal
发信站: BBS 未名空间站 (Mon Oct 15 20:42:02 2007)
我来给大家提议我们开展一项新的业务吧！(为了更好地提高大家对羽毛球的爱好，可
以锻炼大家单打，或双打的水平）
单挑 Ladder
1. Anyone can challenge anyone else
2. 挑战者needs to pay $20伪币 to the Board as proccessing fee
3. If 被挑战者 rejects the challenge, then 被挑战者 will pay $20 back to 挑
战者
4. If 被挑战者 accepts the challenge, the Board will open up 博采 so that
people can bet on the winner/looser.
5. Once 博采 opens up, the Board will |
|
|
t***n
发帖数: 546 | 19 搞bond ladder不如直接买bond fund。 |
|
t***n
发帖数: 546 | 20 搞bond ladder不如直接买bond fund。 |
|
t********t
发帖数: 5415 | 21 差不多，ladder没有一次搞成的，总有一段牺牲return的过程 |
|
c******n
发帖数: 4965 | 22 remember now, someone posted before
just transform each pair of words into an edge if they are different
only by 1 letter. and each word is a vertex.
then the quesition is basically the shortest path from one word to
another. i.e. u can use BFS or Dijkstra. BFS is enough since all the
weights are 1
transformed
ladder
the |
|
p*****p
发帖数: 379 | 23 large TLE了
不过ladder 1判断比较奇葩：hot, hot, ["dot"]那个不是0而是hot->dot->hot是3……
class Solution {
public:
int ladderLength(string start, string end, unordered_set &dict) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
list queue;
set visited;
map stepMap;
queue.push_back(start);
visited.insert(start);
stepMap[start] = 1;
while (!queue.empty()) {
string... 阅读全帖 |
|
w****x
发帖数: 2483 | 24
感觉正常的思路是有一步pre processing,就是先把dict建图，
然后后续的查询ladder从建好的图为出发点。
这个图可以用map表示 |
|
i**********e
发帖数: 1145 | 25 DFS 肯定过不了。最长的ladder length 是 42。
BFS + 记路径是正解。
但怎么记路径使得空间少 + 重建路径是比较tricky。 |
|
i**********e
发帖数: 1145 | 26 word ladder II 有人过了 large tests 吗？
我抛砖引玉一下吧，希望有大牛可以提出更好的解法。
思路就是按照 wwwyhx 的思路 backtrack 重建路径。昨晚写了一下，果然简洁很多，
整个程序不到50行。
基于程序可读性，所以 bottom up 返回路径，产生了很多不必要的拷贝而导致效率会
差很多。但路径组合没那么多，所以性能上也没什么影响。
typedef unordered_multimap Map;
typedef pair PairIter;
vector> findLadders(string start, string end, unordered_set<
string> &dict) {
Map map, map2;
queue q, q2;
q.push(start);
bool goal = false;
while (!q.empty()) {
... 阅读全帖 |
|
p*****p
发帖数: 379 | 27 large TLE了
不过ladder 1判断比较奇葩：hot, hot, ["dot"]那个不是0而是hot->dot->hot是3……
class Solution {
public:
int ladderLength(string start, string end, unordered_set &dict) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
list queue;
set visited;
map stepMap;
queue.push_back(start);
visited.insert(start);
stepMap[start] = 1;
while (!queue.empty()) {
string... 阅读全帖 |
|
w****x
发帖数: 2483 | 28
感觉正常的思路是有一步pre processing,就是先把dict建图，
然后后续的查询ladder从建好的图为出发点。
这个图可以用map表示 |
|
i**********e
发帖数: 1145 | 29 DFS 肯定过不了。最长的ladder length 是 42。
BFS + 记路径是正解。
但怎么记路径使得空间少 + 重建路径是比较tricky。 |
|
i**********e
发帖数: 1145 | 30 word ladder II 有人过了 large tests 吗？
我抛砖引玉一下吧，希望有大牛可以提出更好的解法。
思路就是按照 wwwyhx 的思路 backtrack 重建路径。昨晚写了一下，果然简洁很多，
整个程序不到50行。
基于程序可读性，所以 bottom up 返回路径，产生了很多不必要的拷贝而导致效率会
差很多。但路径组合没那么多，所以性能上也没什么影响。
typedef unordered_multimap Map;
typedef pair PairIter;
vector> findLadders(string start, string end, unordered_set<
string> &dict) {
Map map, map2;
queue q, q2;
q.push(start);
bool goal = false;
while (!q.empty()) {
... 阅读全帖 |
|
c******a
发帖数: 789 | 31 word ladder I的话只要BFS就够了（java），想要大set不超时，关键就是一边加新词
进queue，一边从dict里remove掉。 |
|
j******s
发帖数: 48 | 32 Hi,请问word ladder II 的测试数据是不有点问题么？
对于输入:
"hit", "cog", ["hot","cog","dot","dog","hit","lot","log"]
我的输出是
[["hit","hot","dot","dog","cog"],["hit","hot","lot","log","cog"],["hot","dot
","lot","log","cog"],["hot","dot","dog","log","cog"]]
测试数据输出的是
[["hit","hot","dot","dog","cog"],["hit","hot","lot","log","cog"]]
根据题目的定义应该是都可以的吧？
嗯嗯，我知道答案是不是正确不是特别重要，只是这道题我花了很多时间对比BFS,DFS,
IDS以及实现他们的一些不同方式，所以希望可以求证一下而已。
附贴上我的代码
class Solution {
private:
class Node{
public:
string word;
vector阅读全帖 |
|
g***j
发帖数: 1275 | 33 为啥二爷标定的Word Ladder II 的难度是1， 难道这题是最简单的么？ |
|
h**o
发帖数: 548 | 34 两题有什么本质区别使得你们会想到一题用DP, 另一题用BFS?
1. Edit Distance：
-----------------
Given two words word1 and word2, find the minimum number of steps required
to convert word1 to word2. (each operation is counted as 1 step.)
You have the following 3 operations permitted on a word:
a) Insert a character
b) Delete a character
c) Replace a character
2. Word Ladder
-----------------
Given two words (start and end), and a dictionary, find the length of
shortest transformation sequence from start to end, such that:
O... 阅读全帖 |
|
g****o
发帖数: 547 | 35 我也有疑问 word ladder能不能用A*搜索 会不会比bfs要好 |
|
a**d
发帖数: 85 | 36 我的code就是每次往queue里加一个stack，然后BFS去找end，如果找到，那个stack就
包含所有的ladder。
能通过小测试，可是大的最后一个非常大的dict fail掉。
我觉得应该不是发生死循环了吧。每次我把之前level的words都加到hashset里防止下
面的重复。
请教大神指点一下为什么会fail掉。谢谢 |
|
a***e
发帖数: 413 | 37 写了很久都过不了，15分钟哪里能写完啊？能把思路说清楚就不错了。不知道什么样的
公司和面试官会出这种题。
https://oj.leetcode.com/problems/word-ladder-ii/
vector> findLadders(string start, string end, unordered_set<
string> &dict) {
vector> res;
vector> empty;
queue curLevel;
queue nextLevel;
vector path;
path.push_back(start);
curLevel.push(start);
res.push_back(path);
string word = start;
bool find = false;
int n = word.size();
bo... 阅读全帖 |
|
k*******a
发帖数: 433 | 38 有人知道word ladder II的时间复杂度吗？
谢谢！ |
|
a***e
发帖数: 413 | 39 写了很久都过不了，15分钟哪里能写完啊？能把思路说清楚就不错了。不知道什么样的
公司和面试官会出这种题。
https://oj.leetcode.com/problems/word-ladder-ii/
vector> findLadders(string start, string end, unordered_set<
string> &dict) {
vector> res;
vector> empty;
queue curLevel;
queue nextLevel;
vector path;
path.push_back(start);
curLevel.push(start);
res.push_back(path);
string word = start;
bool find = false;
int n = word.size();
bo... 阅读全帖 |
|
k*******a
发帖数: 433 | 40 有人知道word ladder II的时间复杂度吗？
谢谢！ |
|
p*********g
发帖数: 2998 | 41 这题思路先用word ladder 1的bfs找到所有可能性, 再用dfs打印所有可能性
感觉这题都算简单题了, 如果不变种的话 |
|
a***e
发帖数: 413 | 42 https://leetcode.com/problems/word-ladder/
如果也不用其他的如map一类来标记是否已经访问过某个词，有人只用一个queue搞定吗？
class Solution {
public:
int ladderLength(string start, string end, unordered_set &dict) {
int ns=start.size(), ne=end.size();
if (ns==0&&ne==0) return 0;
queue q;
string mid;
q.push(start);
int c=1, find=0;
while(q.empty()!=true)
{
start=q.front();
q.pop();
if ( start==end)
... 阅读全帖 |
|
j*******l
发帖数: 1066 | 43 蒙特卡洛树算法精髓据说是砍掉不相关枝节 减少下一层的计算量
这极度简化后不就是Word Ladder II 里面的2 End BFS吗 通过两头计算减少运算量
看来这算法还是有实际用途 赶紧再去刷一遍题 |
|
x****3
发帖数: 62 | 44 看到LintCode出了Big Data的Ladder, 现有13道题。有访问权限的同学能否贴一下问题
集？ 比如
500. Invert Index
503. Anagram Map Reduce
504. Invert Index Map Reduce
549. Top k Frequent Words Map Reduce
.... （缺9道？）
谢谢 |
|
|
s****i
发帖数: 2993 | 46 Stabilizer helps. But don't know how high your house is and high strong your
ladder is |
|
