Publish Date : 2020-02-17 09:44 題目： On a plane there are n points with integer coordinates points[i] = [xi, yi]. Your task is to find the minimum time in seconds to visit all points. You can move according to the next rules: * In one second always you can either move vertically, horizontally by one unit or diagonally (it means to move one unit vertically and one unit
Publish Date : 2019-12-20 10:16 題目： Balanced strings are those who have equal quantity of ‘L’ and ‘R’ characters. Given a balanced string s split it in the maximum amount of balanced strings. Return the maximum amount of splitted balanced strings. example： Input: s = “RLRRLLRLRL”
Publish Date : 2019-12-18 10:23 題目： Given head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds the binary representation of a number.Return the decimal value of the number in the linked list. Golang的解法： 看Hint1是