题目描述
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.
题目大意
平面上有n个点，找出共线的点的最大个数
解题思路
很容易想到O(n^3)的解法，通过起点i，终点j枚举直线，然后枚举中间点k，依次判断k与i,j是否共线，统计最大值。
实际上，采用此题可以采用O(n^2 * log ...
[Leetcode]Max Points on a Line
[Leetcode]Evaluate Reverse Polish Notation
作者是
发布于
在
LeetCode,
Python.
题目描述
Evaluate the value of an arithmetic expression in Reverse Polish Notation.
Valid operators are +, -, *, /. Each operand may be an integer or another expression.
Some examples:
["2", "1", "+", "3", "*"] -> ((2 + 1) * 3) -> 9 ...
[Leetcode]Reverse Words in a String
作者是
发布于
在
LeetCode,
Python.
题目描述
Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue",
return "blue is sky the".
Clarification:
What constitutes a word?
A sequence of non-space characters constitutes a word.
Could the input ...
[Leetcode]Find Minimum in Rotated Sorted Array
作者是
发布于
在
LeetCode,
Python.
题目描述：
LeetCode 153. Find Minimum in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2 ...
[LeetCode]Maximum Product Subarray
作者是
发布于
在
LeetCode,
Python.
题目描述：
Find the contiguous subarray within an array (containing at least one number) which has the largest product.
For example, given the array [2,3,-2,4],
the contiguous subarray [2,3] has the largest product = 6.
题目大意：
从数组（至少包含一个数字 ...