LeetCodeDiary

A Diary for solving LeetCode problems

View on GitHub
'''
Description: 
Autor: Au3C2
Date: 2021-01-17 19:30:37
LastEditors: Au3C2
LastEditTime: 2021-01-17 19:30:58
'''
class Solution:
    def checkStraightLine(self, coordinates: List[List[int]]) -> bool:
        n = len(coordinates)
        c = coordinates
        for i in range(2,n):
            if (c[i][0]-c[0][0])*(c[1][1]-c[0][1]) != \
                (c[i][1]-c[0][1])*(c[1][0]-c[0][0]):
                return False
        return True

# 数组,简单,每日一题
# https://leetcode-cn.com/problems/check-if-it-is-a-straight-line/