lanter专业破解版下载百度云
More Questions »
0of 0 votesfind target in chess board with given start position of knight
0of 0 votesBob and Alice have teamed up on a game show. They won the first
round, allowing them access to a maze with hidden gold. If Bob can
collect all the gold coins and deliver them to Alice's position, they can
split the gold. Bob can move North⇆South or East⇆West as long as he
stays in the maze and the cell is not blocked. The task is to determine
the shortest path Bob can follow to collect all gold coins and deliver
them to Alice. If it is not possible, return -1.
You will be given an n × m array where each of the values ∈ {0, 1, 2}
representing open, blocked and open with a gold coin. Alice's position is
given as (x,y) = (row, column). Bob starts at the top left in cell (0, 0).
For example, maze = [[0,2,1],[1,2,0],[1,0,0]] with Alice at (2,2) is
represented as follows:
0 2 1
1 2 0
1 0 0
minMoves has the following parameter(s):
maze[maze[0][0],...maze[n-1][m-1]]: a 2D array of integers
x: an integer denoting Alice's row coordinate
y: an integer denoting Alice's column coordinate
Constraints
1 ≤ n, m ≤ 100
0 ≤ the number of coins ≤ 10
1 ≤ x < n
1 ≤ y < m
The first line contains an integer n, the numbers of rows in maze.
The second line contains an integer m, the number of columns in
maze.
Each of the next n lines contains m space-separated integers
describing the cells of each row in maze.
The next line contains an integer x.
The next line contains an integer, y.
Sample Input 0
3
3
0 2 0
0 0 1
1 1 1
1
1
Sample Output 0
2
Explanation 0
The shortest path Bob can take is (0, 0) → (0, 1) → (1, 1).
Sample Input 1
3
3
0 1 0
1 0 1
0 2 2
1
1
Sample Output 1
-1
Explanation 1
It is not possible for Bob to reach Alice, so we return −1.
Sample Input 2
3
3
0 2 0
1 1 2
1 0 0
2
1
Sample Output 2
5
Explanation 2
The shortest path Bob can take is (0, 0) → (0, 1) → (0, 2) → (1, 2) → (2, 2) → (2, 1).
1of 1 voteMagical Rings+27632807647 & Mystical Power Miracles For Pastors to Perform Miracles in USA CANADA AUSTRALIA ZAMBIA Zimbabwe Jamaica SOUTH AFRICA
0of 0 votesDesign a system to efficiently find 10 top selling products on an online shopping site at a given time with a time window of say 20 minutes.
Say, every second 100 products buy count getting updated.
Which data structure && algorithm would be the best to design such kind of systems ?
0of 0 votesGiven a array of integers find the index which partitions the array to two with high numbers and low numbers. For example [5, -1, 3, 8,6] the index 3 will partition the array to [5,-1,3] and [8,6] all the numbers in the second partition are greater than first. The solution has to work in O(n).