Advertisement
LikeRampage

Python leetcode 335. Self Crossing Chatgpt

May 2nd, 2024 (edited)
614
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.70 KB | None | 0 0
  1. from typing import List
  2.  
  3. class Solution:
  4.     def isSelfCrossing(self, distance: List[int]) -> bool:
  5.         if len(distance) < 4:
  6.             return False
  7.        
  8.         for i in range(3, len(distance)):
  9.             if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:
  10.                 return True
  11.             if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:
  12.                 return True
  13.             if i >= 5 and distance[i-2] >= distance[i-4] and distance[i] + distance[i-4] >= distance[i-2] and distance[i-1] <= distance[i-3] and distance[i-1] + distance[i-5] >= distance[i-3]:
  14.                 return True
  15.        
  16.         return False
Tags: python3
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement