c******o
发帖数: 1277 | 1 Q2) Given a list of characters and an int which is the distance between the
same characters
Eg: input- aaaaabbbbcc and distance as 2. One of the outputs can be-
aabaababbcc
Come up with an algorithm and Code it.
好吧，我承认，给我的人说他也不记得了，当时就是挺confused的。
来另一个吧：
Q2) Find out if two inputs are Anagrams with HUGE HUGE input (like thousand of terabyte)
Q3) Given lots and lots of points in a 2D space find all the line with most points on it. |
a********a
发帖数: 219 | 2 不理解你说的是什么。
the
【在 c******o 的大作中提到】
: Q2) Given a list of characters and an int which is the distance between the
: same characters
: Eg: input- aaaaabbbbcc and distance as 2. One of the outputs can be-
: aabaababbcc
: Come up with an algorithm and Code it.
: 好吧，我承认，给我的人说他也不记得了，当时就是挺confused的。
: 来另一个吧：
: Q2) Find out if two inputs are Anagrams with HUGE HUGE input (like thousand of terabyte)
: Q3) Given lots and lots of points in a 2D space find all the line with most points on it.
|
H*M
发帖数: 1268 | 3 what r u talking about??
the
【在 c******o 的大作中提到】
: Q2) Given a list of characters and an int which is the distance between the
: same characters
: Eg: input- aaaaabbbbcc and distance as 2. One of the outputs can be-
: aabaababbcc
: Come up with an algorithm and Code it.
: 好吧，我承认，给我的人说他也不记得了，当时就是挺confused的。
: 来另一个吧：
: Q2) Find out if two inputs are Anagrams with HUGE HUGE input (like thousand of terabyte)
: Q3) Given lots and lots of points in a 2D space find all the line with most points on it.
|
m*****f
发帖数: 1243 | 4 Cannot understand at all.
the
【在 c******o 的大作中提到】
: Q2) Given a list of characters and an int which is the distance between the
: same characters
: Eg: input- aaaaabbbbcc and distance as 2. One of the outputs can be-
: aabaababbcc
: Come up with an algorithm and Code it.
: 好吧，我承认，给我的人说他也不记得了，当时就是挺confused的。
: 来另一个吧：
: Q2) Find out if two inputs are Anagrams with HUGE HUGE input (like thousand of terabyte)
: Q3) Given lots and lots of points in a 2D space find all the line with most points on it.
|
c******o
发帖数: 1277 | 5 好吧，我承认，给我的人说他也不记得了，当时就是挺confused的。
来另一个吧：
Q2) Find out if two inputs are Anagrams with HUGE HUGE input (like thousand
of terabyte)
Q3) Given lots and lots of points in a 2D space find all the line with most
points on it. |
m*******y
发帖数: 68 | 6 I guess the question is:
given a list of characters and an integer n, reorder the characters to
generate one sequence (or all sequences) such that, for any character at
position i in the sequence, the next position that the same character shows
up must be less than or equal to i＋n.
Ex: inputs are "aaaaabbbbcc" and n=2
one of the outputs is: aabaababbcc
the
thousand of terabyte)
most points on it.
【在 c******o 的大作中提到】
: Q2) Given a list of characters and an int which is the distance between the
: same characters
: Eg: input- aaaaabbbbcc and distance as 2. One of the outputs can be-
: aabaababbcc
: Come up with an algorithm and Code it.
: 好吧，我承认，给我的人说他也不记得了，当时就是挺confused的。
: 来另一个吧：
: Q2) Find out if two inputs are Anagrams with HUGE HUGE input (like thousand of terabyte)
: Q3) Given lots and lots of points in a 2D space find all the line with most points on it.
|
