hihoCoder 1552-缺失的拼图 #1552 :... Read More

# Tag Archives: 几何

# LeetCode Valid Triangle Number

LeetCode Valid Triangle Number Given an array consists of non-negative integers, your task is to count the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle. Example 1: Input: Output:... Read More

# LeetCode Valid Square

LeetCode Valid Square 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 represented by an integer array with two integers. Example: Input: p1 = , p2 = , p3 = ,... Read More

# LeetCode Rectangle Area

LeetCode Rectangle Area Find the total area covered by two rectilinear rectangles in a 2D plane. Each rectangle is defined by its bottom left corner and top right corner as shown in the figure. Assume that the total area is never beyond the maximum... Read More

# hihoCoder 1040-矩形判断

hihoCoder 1040-矩形判断 #1040 :... Read More