摘要：
You are playing a simplified Pacman game. You start at the point (0, 0), and your destination is (target[0], target[1]). There are several ghosts on t 阅读全文
posted @ 2019-05-17 17:00
Veritas_des_Liberty
阅读(274)
评论(0)
推荐(0)
摘要：
There is a box protected by a password. The password is n digits, where each letter can be one of the first k digits 0, 1, ..., k-1. You can keep inpu 阅读全文
posted @ 2019-05-16 22:34
Veritas_des_Liberty
阅读(299)
评论(0)
推荐(0)
摘要：
A move consists of taking a point (x, y) and transforming it to either (x, x+y) or (x+y, y). Given a starting point (sx, sy) and a target point (tx, t 阅读全文
posted @ 2019-05-15 22:30
Veritas_des_Liberty
阅读(290)
评论(0)
推荐(0)
摘要：
You are standing at position 0 on an infinite number line. There is a goal at position target. On each move, you can either go left or right. During t 阅读全文
posted @ 2019-05-15 22:08
Veritas_des_Liberty
阅读(272)
评论(0)
推荐(0)
摘要：
The set S originally contains numbers from 1 to n. But unfortunately, due to the data error, one of the numbers in the set got duplicated to another n 阅读全文
posted @ 2019-05-14 22:30
Veritas_des_Liberty
阅读(226)
评论(0)
推荐(0)
摘要：
Given a non-negative integer c, your task is to decide whether there're two integers a and b such that a2 + b2 = c. Example 1: Example 2: Approach #1: 阅读全文
posted @ 2019-05-14 21:23
Veritas_des_Liberty
阅读(203)
评论(0)
推荐(0)
摘要：
Given a string representing an expression of fraction addition and subtraction, you need to return the calculation result in string format. The final 阅读全文
posted @ 2019-05-14 20:42
Veritas_des_Liberty
阅读(232)
评论(0)
推荐(0)
摘要：
Given the coordinates of four points in 2D space, return whether the four points could construct a square. The coordinate (x,y) of a point is represen 阅读全文
posted @ 2019-05-14 20:05
Veritas_des_Liberty
阅读(174)
评论(0)
推荐(0)
摘要：
There are 1000 buckets, one and only one of them is poisonous, while the rest are filled with water. They all look identical. If a pig drinks the pois 阅读全文
posted @ 2019-05-13 21:28
Veritas_des_Liberty
阅读(221)
评论(0)
推荐(0)
摘要：
Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n 阅读全文
posted @ 2019-05-12 22:07
Veritas_des_Liberty
阅读(201)
评论(0)
推荐(0)
浙公网安备 33010602011771号