g***j
发帖数: 1275 | 1 看了好多遍都没明白要表达什么意思
Given 2 links attached end to end with lengths L0 and L1 respectively, a
point P0 that the first link starts at, and a point P1 that you want the end
of the 2nd link to be at, write a function that finds the configurations of
the links that put the 2nd link’s end at point P1.
1 什么叫attached end to end? 到底是尾结点指向尾结点还是尾结点指向另外一个头
结点?
2 什么叫fund the configuration of the links?
3 到底给了什么,2 links, L0, L1, P0, P1, 那要求输出什么, configuration?
我觉得我英语没有这么差啊. 人家发过来的题目要做, 我email过去问啥意思也不回复,
只能版上问了, | P*******e
发帖数: 1353 | 2 感觉确实没说清楚啊，找人家要个example吧
end
of
复,
【在 g***j 的大作中提到】
: 看了好多遍都没明白要表达什么意思
: Given 2 links attached end to end with lengths L0 and L1 respectively, a
: point P0 that the first link starts at, and a point P1 that you want the end
: of the 2nd link to be at, write a function that finds the configurations of
: the links that put the 2nd link’s end at point P1.
: 1 什么叫attached end to end? 到底是尾结点指向尾结点还是尾结点指向另外一个头
: 结点?
: 2 什么叫fund the configuration of the links?
: 3 到底给了什么,2 links, L0, L1, P0, P1, 那要求输出什么, configuration?
: 我觉得我英语没有这么差啊. 人家发过来的题目要做, 我email过去问啥意思也不回复,
| g***j
发帖数: 1275 | 3 发了, 人家没有回复
这都周末了,人家不会回复了,哭死, 只能瞎猜了.
【在 P*******e 的大作中提到】
: 感觉确实没说清楚啊，找人家要个example吧
:
: end
: of
: 复,
| P*******e
发帖数: 1353 | 4 link是单向的？貌似是tail连了tail，然后configuration就是打印出每个节点吧，可能
本质上就是让你reverse第二个link list，已知的东西是有些多。。。不过也可以用上
【在 g***j 的大作中提到】
: 发了, 人家没有回复
: 这都周末了,人家不会回复了,哭死, 只能瞎猜了.
| h****h
发帖数: 75 | 5 应该是找另外一个point P2，使得P2和P0距离L0，P2和P1距离L1。
end
of
复,
【在 g***j 的大作中提到】
: 看了好多遍都没明白要表达什么意思
: Given 2 links attached end to end with lengths L0 and L1 respectively, a
: point P0 that the first link starts at, and a point P1 that you want the end
: of the 2nd link to be at, write a function that finds the configurations of
: the links that put the 2nd link’s end at point P1.
: 1 什么叫attached end to end? 到底是尾结点指向尾结点还是尾结点指向另外一个头
: 结点?
: 2 什么叫fund the configuration of the links?
: 3 到底给了什么,2 links, L0, L1, P0, P1, 那要求输出什么, configuration?
: 我觉得我英语没有这么差啊. 人家发过来的题目要做, 我email过去问啥意思也不回复,
| l***i
发帖数: 1309 | 6 Given segment |P0->P1|=L0 and |P1->P2|=L1, and the coordinates of P0 and P2,
find the set of points that P1 can take.
// typed a lot of Chinese but then got network disconnected. Hope the above
makes more sense than the original problem. | d**a
发帖数: 84 | 7 is it a 2-circle problem?
L0 determine a circle and l2 another one. so P1 can only be 2 points most.
P2,
above
【在 l***i 的大作中提到】
: Given segment |P0->P1|=L0 and |P1->P2|=L1, and the coordinates of P0 and P2,
: find the set of points that P1 can take.
: // typed a lot of Chinese but then got network disconnected. Hope the above
: makes more sense than the original problem.
|
|
