Posts

Showing posts from January, 2019

1104. Judge Route Circle

class Solution { public : /** * @param moves: a sequence of its moves * @return: if this robot makes a circle */ bool judgeCircle ( string &moves) { // Write your code here unordered_map < char , int > map ; for ( int i = 0 ; i < moves.size(); i++){ map [moves[i]]++; } return map [ 'L' ] == map [ 'R' ] && map [ 'U' ] == map [ 'D' ]; } };

824. Single Number IV

class Solution { public : /** * @param nums: The number array * @return: Return the single number */ int getSingleNumber ( vector < int > &nums) { // Write your code here int sizeN = nums.size(); if (sizeN == 0 ){ return -1 ; } int res = nums[ 0 ]; for ( int i = 1 ; i < sizeN; i++){ res ^= nums[i]; } return res; } };

788. The Maze II

Description 中文 English There is a ball in a maze with empty spaces and walls. The ball can go through empty spaces by rolling  up ,  down ,  left  or  right , but it won't stop rolling until hitting a wall. When the ball stops, it could choose the next direction. Given the ball's start position, the destination and the maze, find the shortest distance for the ball to stop at the destination. The distance is defined by the number of empty spaces traveled by the ball from the start position (excluded) to the destination (included). If the ball cannot stop at the destination, return -1. The maze is represented by a binary 2D array. 1 means the wall and 0 means the empty space. You may assume that the borders of the maze are all walls. The start and destination coordinates are represented by row and column indexes. 1.There is only one ball and one destination in the maze. 2.Both the ball and the destination exist on an empty space, and they ...

check 787. The Maze

Description 中文 English There is a ball in a maze with empty spaces and walls. The ball can go through empty spaces by rolling  up ,  down ,  left  or  right ,  but it won't stop rolling until hitting a wall . When the ball stops, it could choose the next direction. Given the ball's start position, the destination and the maze, determine whether the ball could stop at the destination. The maze is represented by a binary 2D array. 1 means the wall and 0 means the empty space. You may assume that the borders of the maze are all walls. The start and destination coordinates are represented by row and column indexes. 1.There is only one ball and one destination in the maze. 2.Both the ball and the destination exist on an empty space, and they will not be at the same position initially. 3.The given maze does not contain border (like the red rectangle in the example pictures), but you could assume the border of the maze are all walls. 5.The ...