A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put

蓝桥杯第10届java B组第1-4题。不含题目，仅供参考-Blue Bridge 10th java Cup Group B title 1-4

蓝桥杯第10届java B组第5-9题，不含题目，仅供参考-Blue Bridge 10th java Cup Group B 5-9 questions, without problems, for reference only