当前位置: 代码迷 >> 综合 >> [LeetCode 335] Self Crossing
  详细解决方案

[LeetCode 335] Self Crossing

热度:54   发布时间:2024-01-04 07:35:37.0

You are given an array x of n positive numbers. You start at point (0,0) and moves x[0] metres to the north, then x[1] metres to the west, x[2] metres to the south,