[Leetcode] Convex Polygon Convex polygon

Source: Internet
Author: User

Given a list of points so form a polygon when joined sequentially, find if the polygon is convex (convex polygon Defini tion).

Note:

    1. There is at the least 3 and at the most points.
    2. Coordinates is in the range-10,000 to 10,000.
    3. Assume the polygon formed by given points are always a simple polygon (simple polygon definition). In the other words, we ensure that exactly the edges intersect at all vertex, and that edges otherwise don ' t intersect ea ChOther.

Example 1:

[[0,0],[0,1],[1,1],[1,0]] Answer:trueexplanation:

Example 2:

[[0,0],[0,10],[10,10],[10,0],[5,5]] Answer:falseexplanation:

S

[Leetcode] Convex Polygon Convex polygon

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.