{"id":1103518,"date":"2025-01-08T16:11:21","date_gmt":"2025-01-08T08:11:21","guid":{"rendered":"https:\/\/docs.pingcode.com\/ask\/ask-ask\/1103518.html"},"modified":"2025-01-08T16:11:28","modified_gmt":"2025-01-08T08:11:28","slug":"python%e5%a6%82%e4%bd%95%e5%88%a4%e6%96%ad%e4%b8%a4%e4%b8%aa%e7%9f%a9%e5%bd%a2%e4%b8%a4%e4%ba%a4","status":"publish","type":"post","link":"https:\/\/docs.pingcode.com\/ask\/ask-ask\/1103518.html","title":{"rendered":"python\u5982\u4f55\u5224\u65ad\u4e24\u4e2a\u77e9\u5f62\u4e24\u4ea4"},"content":{"rendered":"

\"python\u5982\u4f55\u5224\u65ad\u4e24\u4e2a\u77e9\u5f62\u4e24\u4ea4\"<\/p>\n

Python \u5224\u65ad\u4e24\u4e2a\u77e9\u5f62\u662f\u5426\u76f8\u4ea4<\/strong><\/p>\n<\/p>\n

\u5728Python\u4e2d\uff0c\u53ef\u4ee5\u901a\u8fc7\u6bd4\u8f83\u4e24\u4e2a\u77e9\u5f62\u7684\u8fb9\u754c\u6765\u5224\u65ad\u5b83\u4eec\u662f\u5426\u76f8\u4ea4\u3002\u5224\u65ad\u4e24\u4e2a\u77e9\u5f62\u662f\u5426\u76f8\u4ea4\u7684\u6838\u5fc3\u65b9\u6cd5\u662f\u68c0\u67e5\u4e00\u4e2a\u77e9\u5f62\u7684\u8fb9\u754c\u662f\u5426\u7a7f\u8fc7\u53e6\u4e00\u4e2a\u77e9\u5f62\u7684\u8fb9\u754c\u3001\u5224\u65ad\u4e24\u4e2a\u77e9\u5f62\u7684\u8fb9\u754c\u662f\u5426\u5b58\u5728\u91cd\u53e0\u533a\u57df\u3001\u901a\u8fc7\u6bd4\u8f83\u77e9\u5f62\u7684\u5de6\u3001\u53f3\u3001\u4e0a\u3001\u4e0b\u8fb9\u754c\u6765\u786e\u5b9a\u76f8\u4ea4\u60c5\u51b5<\/strong>\u3002\u4e0b\u9762\u5c06\u8be6\u7ec6\u4ecb\u7ecd\u5176\u4e2d\u7684\u4e00\u4e2a\u65b9\u6cd5\uff1a\u901a\u8fc7\u6bd4\u8f83\u77e9\u5f62\u7684\u5de6\u3001\u53f3\u3001\u4e0a\u3001\u4e0b\u8fb9\u754c\u6765\u786e\u5b9a\u76f8\u4ea4\u60c5\u51b5\u3002<\/p>\n<\/p>\n

\u4e00\u3001\u77e9\u5f62\u7684\u8fb9\u754c\u5b9a\u4e49<\/h3>\n<\/p>\n

\u77e9\u5f62\u901a\u5e38\u7531\u5176\u5de6\u4e0a\u89d2\u548c\u53f3\u4e0b\u89d2\u7684\u5750\u6807\u5b9a\u4e49\u3002\u5047\u8bbe\u6211\u4eec\u6709\u4e24\u4e2a\u77e9\u5f62\uff0c\u77e9\u5f62A\u548c\u77e9\u5f62B\uff0c\u5b83\u4eec\u7684\u5de6\u4e0a\u89d2\u548c\u53f3\u4e0b\u89d2\u5750\u6807\u5206\u522b\u4e3a\uff1a(Ax1, Ay1), (Ax2, Ay2) \u548c (Bx1, By1), (Bx2, By2)\u3002\u4e3a\u4e86\u7b80\u5355\u8d77\u89c1\uff0c\u6211\u4eec\u5047\u8bbe\u5750\u6807\u7cfb\u7edf\u7684\u539f\u70b9\u5728\u5de6\u4e0a\u89d2\uff0cy\u8f74\u5411\u4e0b\u5ef6\u4f38\u3002<\/p>\n<\/p>\n

\u4e8c\u3001\u5224\u65ad\u77e9\u5f62\u662f\u5426\u76f8\u4ea4\u7684\u6761\u4ef6<\/h3>\n<\/p>\n

\u4e24\u4e2a\u77e9\u5f62\u76f8\u4ea4\u7684\u6761\u4ef6\u53ef\u4ee5\u901a\u8fc7\u4ee5\u4e0b\u903b\u8f91\u5224\u65ad\uff1a<\/p>\n<\/p>\n

    \n
  1. \u77e9\u5f62A\u7684\u53f3\u8fb9\u754c\u5c0f\u4e8e\u77e9\u5f62B\u7684\u5de6\u8fb9\u754c<\/strong><\/li>\n
  2. \u77e9\u5f62A\u7684\u5de6\u8fb9\u754c\u5927\u4e8e\u77e9\u5f62B\u7684\u53f3\u8fb9\u754c<\/strong><\/li>\n
  3. \u77e9\u5f62A\u7684\u4e0b\u8fb9\u754c\u5c0f\u4e8e\u77e9\u5f62B\u7684\u4e0a\u8fb9\u754c<\/strong><\/li>\n
  4. \u77e9\u5f62A\u7684\u4e0a\u8fb9\u754c\u5927\u4e8e\u77e9\u5f62B\u7684\u4e0b\u8fb9\u754c<\/strong><\/li>\n<\/ol>\n

    \u5982\u679c\u4e0a\u8ff0\u56db\u4e2a\u6761\u4ef6\u4e2d\u4efb\u4f55\u4e00\u4e2a\u4e3a\u771f\uff0c\u5219\u77e9\u5f62A\u548c\u77e9\u5f62B\u4e0d\u76f8\u4ea4\u3002\u5426\u5219\uff0c\u5b83\u4eec\u76f8\u4ea4\u3002<\/p>\n<\/p>\n

    \u4e09\u3001\u901a\u8fc7Python\u4ee3\u7801\u5b9e\u73b0<\/h3>\n<\/p>\n

    \u901a\u8fc7Python\u4ee3\u7801\uff0c\u6211\u4eec\u53ef\u4ee5\u5b9e\u73b0\u4e0a\u8ff0\u903b\u8f91\u6765\u5224\u65ad\u4e24\u4e2a\u77e9\u5f62\u662f\u5426\u76f8\u4ea4\u3002\u4ee5\u4e0b\u662f\u4e00\u4e2a\u793a\u4f8b\u4ee3\u7801\uff1a<\/p>\n<\/p>\n

    def is_rectangles_intersect(Ax1, Ay1, Ax2, Ay2, Bx1, By1, Bx2, By2):<\/p>\n
        # \u68c0\u67e5\u77e9\u5f62A\u548c\u77e9\u5f62B\u662f\u5426\u4e0d\u76f8\u4ea4<\/p>\n
        if Ax2 < Bx1 or Ax1 > Bx2 or Ay2 < By1 or Ay1 > By2:<\/p>\n
            return False<\/p>\n
        return True<\/p>\n
    \u793a\u4f8b\u4f7f\u7528<\/strong><\/h2>\n
    Ax1, Ay1, Ax2, Ay2 = 1, 1, 4, 4<\/p>\n
    Bx1, By1, Bx2, By2 = 2, 2, 5, 5<\/p>\n
    if is_rectangles_intersect(Ax1, Ay1, Ax2, Ay2, Bx1, By1, Bx2, By2):<\/p>\n
        print("\u77e9\u5f62A\u548c\u77e9\u5f62B\u76f8\u4ea4")<\/p>\n
    else:<\/p>\n
        print("\u77e9\u5f62A\u548c\u77e9\u5f62B\u4e0d\u76f8\u4ea4")<\/p>\n
    <\/code><\/pre>\n<\/p>\n
    \u56db\u3001\u6269\u5c55\u5e94\u7528<\/h3>\n<\/p>\n
    \u77e9\u5f62\u76f8\u4ea4\u5224\u65ad\u5728\u8ba1\u7b97\u673a\u56fe\u5f62\u5b66\u3001\u78b0\u649e\u68c0\u6d4b\u548c\u51e0\u4f55\u8ba1\u7b97\u4e2d\u6709\u5e7f\u6cdb\u7684\u5e94\u7528\u3002\u6211\u4eec\u53ef\u4ee5\u8fdb\u4e00\u6b65\u6269\u5c55\u8fd9\u4e2a\u57fa\u672c\u7684\u5224\u65ad\u903b\u8f91\u6765\u5904\u7406\u66f4\u591a\u590d\u6742\u7684\u573a\u666f\uff0c\u4f8b\u5982\uff1a<\/p>\n<\/p>\n
      \n
    1. \u591a\u77e9\u5f62\u76f8\u4ea4\u68c0\u6d4b<\/strong>\uff1a\u5904\u7406\u591a\u4e2a\u77e9\u5f62\u7684\u76f8\u4ea4\u95ee\u9898\uff0c\u4f7f\u7528\u7c7b\u4f3c\u7684\u903b\u8f91\u904d\u5386\u6240\u6709\u77e9\u5f62\u5bf9\u3002<\/li>\n
    2. \u68c0\u6d4b\u76f8\u4ea4\u533a\u57df<\/strong>\uff1a\u4e0d\u4ec5\u5224\u65ad\u662f\u5426\u76f8\u4ea4\uff0c\u8fd8\u53ef\u4ee5\u8ba1\u7b97\u76f8\u4ea4\u7684\u533a\u57df\u3002<\/li>\n
    3. \u4f18\u5316\u7b97\u6cd5<\/strong>\uff1a\u5728\u5904\u7406\u5927\u91cf\u77e9\u5f62\u65f6\uff0c\u4f7f\u7528\u66f4\u9ad8\u6548\u7684\u6570\u636e\u7ed3\u6784\u548c\u7b97\u6cd5\uff0c\u5982\u56db\u53c9\u6811\u3001\u7a7a\u95f4\u5206\u5272\u7b49\u3002<\/li>\n<\/ol>\n
      \u4e94\u3001\u6df1\u5165\u5206\u6790<\/h3>\n<\/p>\n
      1. \u591a\u77e9\u5f62\u76f8\u4ea4\u68c0\u6d4b<\/h4>\n<\/p>\n
      \u5728\u5904\u7406\u591a\u77e9\u5f62\u76f8\u4ea4\u95ee\u9898\u65f6\uff0c\u53ef\u4ee5\u91c7\u7528\u5d4c\u5957\u5faa\u73af\u904d\u5386\u6240\u6709\u77e9\u5f62\u5bf9\uff0c\u4f46\u8fd9\u79cd\u65b9\u6cd5\u5728\u5904\u7406\u5927\u91cf\u77e9\u5f62\u65f6\u6548\u7387\u8f83\u4f4e\u3002\u53ef\u4ee5\u5f15\u5165\u66f4\u9ad8\u6548\u7684\u6570\u636e\u7ed3\u6784\u548c\u7b97\u6cd5\u6765\u4f18\u5316\u6027\u80fd\u3002\u4f8b\u5982\uff0c\u4f7f\u7528\u56db\u53c9\u6811\u6765\u7ec4\u7ec7\u77e9\u5f62\u6570\u636e\uff0c\u63d0\u9ad8\u67e5\u8be2\u6548\u7387\u3002<\/p>\n<\/p>\n
      def find_intersections(rectangles):<\/p>\n
          intersections = []<\/p>\n
          n = len(rectangles)<\/p>\n
          for i in range(n):<\/p>\n
              for j in range(i + 1, n):<\/p>\n
                  if is_rectangles_intersect(*rectangles[i], *rectangles[j]):<\/p>\n
                      intersections.append((rectangles[i], rectangles[j]))<\/p>\n
          return intersections<\/p>\n
      \u793a\u4f8b\u4f7f\u7528<\/strong><\/h2>\n
      rectangles = [<\/p>\n
          (1, 1, 4, 4),<\/p>\n
          (2, 2, 5, 5),<\/p>\n
          (6, 6, 9, 9)<\/p>\n
      ]<\/p>\n
      intersections = find_intersections(rectangles)<\/p>\n
      for rect1, rect2 in intersections:<\/p>\n
          print(f"\u77e9\u5f62{rect1}\u548c\u77e9\u5f62{rect2}\u76f8\u4ea4")<\/p>\n
      <\/code><\/pre>\n<\/p>\n
      2. \u68c0\u6d4b\u76f8\u4ea4\u533a\u57df<\/h4>\n<\/p>\n
      \u5982\u679c\u77e9\u5f62\u76f8\u4ea4\uff0c\u53ef\u4ee5\u8fdb\u4e00\u6b65\u8ba1\u7b97\u76f8\u4ea4\u533a\u57df\u7684\u5750\u6807\u3002\u76f8\u4ea4\u533a\u57df\u7684\u5de6\u4e0a\u89d2\u5750\u6807\u4e3a\u4e24\u77e9\u5f62\u5de6\u4e0a\u89d2\u5750\u6807\u7684\u6700\u5927\u503c\uff0c\u53f3\u4e0b\u89d2\u5750\u6807\u4e3a\u4e24\u77e9\u5f62\u53f3\u4e0b\u89d2\u5750\u6807\u7684\u6700\u5c0f\u503c\u3002<\/p>\n<\/p>\n
      def get_intersection_area(Ax1, Ay1, Ax2, Ay2, Bx1, By1, Bx2, By2):<\/p>\n
          if not is_rectangles_intersect(Ax1, Ay1, Ax2, Ay2, Bx1, By1, Bx2, By2):<\/p>\n
              return None<\/p>\n
          Ix1 = max(Ax1, Bx1)<\/p>\n
          Iy1 = max(Ay1, By1)<\/p>\n
          Ix2 = min(Ax2, Bx2)<\/p>\n
          Iy2 = min(Ay2, By2)<\/p>\n
          return (Ix1, Iy1, Ix2, Iy2)<\/p>\n
      \u793a\u4f8b\u4f7f\u7528<\/strong><\/h2>\n
      intersection_area = get_intersection_area(Ax1, Ay1, Ax2, Ay2, Bx1, By1, Bx2, By2)<\/p>\n
      if intersection_area:<\/p>\n
          print(f"\u76f8\u4ea4\u533a\u57df\u5750\u6807: {intersection_area}")<\/p>\n
      else:<\/p>\n
          print("\u77e9\u5f62A\u548c\u77e9\u5f62B\u4e0d\u76f8\u4ea4")<\/p>\n
      <\/code><\/pre>\n<\/p>\n
      3. \u4f18\u5316\u7b97\u6cd5<\/h4>\n<\/p>\n
      \u5728\u5904\u7406\u5927\u91cf\u77e9\u5f62\u65f6\uff0c\u53ef\u4ee5\u4f7f\u7528\u66f4\u9ad8\u6548\u7684\u6570\u636e\u7ed3\u6784\u548c\u7b97\u6cd5\u3002\u56db\u53c9\u6811\u662f\u4e00\u79cd\u5e38\u7528\u7684\u6570\u636e\u7ed3\u6784\uff0c\u7528\u4e8e\u7a7a\u95f4\u5206\u5272\u548c\u78b0\u649e\u68c0\u6d4b\u3002\u901a\u8fc7\u5c06\u4e8c\u7ef4\u7a7a\u95f4\u9012\u5f52\u5730\u5212\u5206\u4e3a\u56db\u4e2a\u8c61\u9650\uff0c\u53ef\u4ee5\u9ad8\u6548\u5730\u7ec4\u7ec7\u548c\u67e5\u8be2\u77e9\u5f62\u6570\u636e\u3002<\/p>\n<\/p>\n
      class QuadTree:<\/p>\n
          def __init__(self, boundary, capacity):<\/p>\n
              self.boundary = boundary<\/p>\n
              self.capacity = capacity<\/p>\n
              self.rectangles = []<\/p>\n
              self.divided = False<\/p>\n
          def subdivide(self):<\/p>\n
              x, y, w, h = self.boundary<\/p>\n
              self.northeast = QuadTree((x + w \/ 2, y, w \/ 2, h \/ 2), self.capacity)<\/p>\n
              self.northwest = QuadTree((x, y, w \/ 2, h \/ 2), self.capacity)<\/p>\n
              self.southeast = QuadTree((x + w \/ 2, y + h \/ 2, w \/ 2, h \/ 2), self.capacity)<\/p>\n
              self.southwest = QuadTree((x, y + h \/ 2, w \/ 2, h \/ 2), self.capacity)<\/p>\n
              self.divided = True<\/p>\n
          def insert(self, rectangle):<\/p>\n
              if not self.contAI<\/a>ns(self.boundary, rectangle):<\/p>\n
                  return False<\/p>\n
              if len(self.rectangles) < self.capacity:<\/p>\n
                  self.rectangles.append(rectangle)<\/p>\n
                  return True<\/p>\n
              if not self.divided:<\/p>\n
                  self.subdivide()<\/p>\n
              if self.northeast.insert(rectangle):<\/p>\n
                  return True<\/p>\n
              if self.northwest.insert(rectangle):<\/p>\n
                  return True<\/p>\n
              if self.southeast.insert(rectangle):<\/p>\n
                  return True<\/p>\n
              if self.southwest.insert(rectangle):<\/p>\n
                  return True<\/p>\n
              return False<\/p>\n
          def contains(self, boundary, rectangle):<\/p>\n
              x, y, w, h = boundary<\/p>\n
              rx1, ry1, rx2, ry2 = rectangle<\/p>\n
              return (rx1 >= x and rx2 <= x + w and ry1 >= y and ry2 <= y + h)<\/p>\n
          def query(self, range, found):<\/p>\n
              if not self.intersects(self.boundary, range):<\/p>\n
                  return False<\/p>\n
              for rect in self.rectangles:<\/p>\n
                  if self.intersects(range, rect):<\/p>\n
                      found.append(rect)<\/p>\n
              if self.divided:<\/p>\n
                  self.northeast.query(range, found)<\/p>\n
                  self.northwest.query(range, found)<\/p>\n
                  self.southeast.query(range, found)<\/p>\n
                  self.southwest.query(range, found)<\/p>\n
              return found<\/p>\n
          def intersects(self, boundary, rectangle):<\/p>\n
              x, y, w, h = boundary<\/p>\n
              rx1, ry1, rx2, ry2 = rectangle<\/p>\n
              return not (rx2 < x or rx1 > x + w or ry2 < y or ry1 > y + h)<\/p>\n
      \u793a\u4f8b\u4f7f\u7528<\/strong><\/h2>\n
      boundary = (0, 0, 10, 10)<\/p>\n
      capacity = 4<\/p>\n
      quad_tree = QuadTree(boundary, capacity)<\/p>\n
      rectangles = [<\/p>\n
          (1, 1, 4, 4),<\/p>\n
          (2, 2, 5, 5),<\/p>\n
          (6, 6, 9, 9),<\/p>\n
          (7, 7, 8, 8),<\/p>\n
          (3, 3, 6, 6)<\/p>\n
      ]<\/p>\n
      for rect in rectangles:<\/p>\n
          quad_tree.insert(rect)<\/p>\n
      found = []<\/p>\n
      range_query = (2, 2, 7, 7)<\/p>\n
      quad_tree.query(range_query, found)<\/p>\n
      print("\u5728\u67e5\u8be2\u8303\u56f4\u5185\u7684\u77e9\u5f62:", found)<\/p>\n
      <\/code><\/pre>\n<\/p>\n
      \u901a\u8fc7\u4e0a\u8ff0\u65b9\u6cd5\uff0c\u6211\u4eec\u53ef\u4ee5\u9ad8\u6548\u5730\u5224\u65ad\u591a\u4e2a\u77e9\u5f62\u662f\u5426\u76f8\u4ea4\uff0c\u5e76\u627e\u5230\u76f8\u4ea4\u533a\u57df\u3002\u4f18\u5316\u7b97\u6cd5\u53ef\u4ee5\u663e\u8457\u63d0\u9ad8\u5904\u7406\u5927\u91cf\u77e9\u5f62\u7684\u6548\u7387\uff0c\u4f7f\u5f97\u5728\u5b9e\u9645\u5e94\u7528\u4e2d\u66f4\u52a0\u5b9e\u7528\u3002<\/p>\n<\/p>\n
      \u516d\u3001\u603b\u7ed3<\/h3>\n<\/p>\n
      \u901a\u8fc7\u672c\u6587\u7684\u8be6\u7ec6\u4ecb\u7ecd\uff0c\u6211\u4eec\u53ef\u4ee5\u4e86\u89e3\u5230\u5728Python\u4e2d\u5224\u65ad\u4e24\u4e2a\u77e9\u5f62\u662f\u5426\u76f8\u4ea4\u7684\u6838\u5fc3\u65b9\u6cd5\u548c\u5176\u5b9e\u73b0\u903b\u8f91\u3002\u6211\u4eec\u4e0d\u4ec5\u8ba8\u8bba\u4e86\u57fa\u672c\u7684\u77e9\u5f62\u76f8\u4ea4\u5224\u65ad\uff0c\u8fd8\u6269\u5c55\u4e86\u591a\u77e9\u5f62\u76f8\u4ea4\u68c0\u6d4b\u3001\u76f8\u4ea4\u533a\u57df\u8ba1\u7b97\u548c\u4f18\u5316\u7b97\u6cd5\u3002\u5e0c\u671b\u8fd9\u4e9b\u5185\u5bb9\u80fd\u591f\u5e2e\u52a9\u60a8\u66f4\u597d\u5730\u7406\u89e3\u548c\u5e94\u7528\u77e9\u5f62\u76f8\u4ea4\u5224\u65ad\u65b9\u6cd5\uff0c\u63d0\u9ad8\u5728\u76f8\u5173\u9886\u57df\u4e2d\u7684\u5f00\u53d1\u6548\u7387\u3002<\/p>\n<\/p>\n
      \u76f8\u5173\u95ee\u7b54FAQs\uff1a<\/strong><\/h2>\n
       \u5982\u4f55\u5728Python\u4e2d\u68c0\u6d4b\u4e24\u4e2a\u77e9\u5f62\u662f\u5426\u76f8\u4ea4\uff1f<\/strong>
      \u8981\u68c0\u6d4b\u4e24\u4e2a\u77e9\u5f62\u662f\u5426\u76f8\u4ea4\uff0c\u53ef\u4ee5\u4f7f\u7528\u77e9\u5f62\u7684\u5750\u6807\u4fe1\u606f\u6765\u8fdb\u884c\u5224\u65ad\u3002\u5e38\u7528\u7684\u65b9\u6cd5\u662f\u901a\u8fc7\u6bd4\u8f83\u77e9\u5f62\u7684\u8fb9\u754c\u7ebf\u6765\u786e\u5b9a\u5b83\u4eec\u662f\u5426\u91cd\u53e0\u3002\u4f8b\u5982\uff0c\u5047\u8bbe\u77e9\u5f62A\u7684\u5de6\u4e0b\u89d2\u5750\u6807\u4e3a(x1, y1)\uff0c\u53f3\u4e0a\u89d2\u5750\u6807\u4e3a(x2, y2)\uff0c\u800c\u77e9\u5f62B\u7684\u5750\u6807\u4e3a(x3, y3)\u548c(x4, y4)\uff0c\u53ef\u4ee5\u901a\u8fc7\u4ee5\u4e0b\u6761\u4ef6\u5224\u65ad\u5b83\u4eec\u662f\u5426\u76f8\u4ea4\uff1a<\/p>\n
        \n
      • \u77e9\u5f62A\u7684\u53f3\u8fb9\u754c\u5c0f\u4e8e\u77e9\u5f62B\u7684\u5de6\u8fb9\u754c<\/li>\n
      • \u77e9\u5f62B\u7684\u53f3\u8fb9\u754c\u5c0f\u4e8e\u77e9\u5f62A\u7684\u5de6\u8fb9\u754c<\/li>\n
      • \u77e9\u5f62A\u7684\u4e0a\u8fb9\u754c\u5c0f\u4e8e\u77e9\u5f62B\u7684\u4e0b\u8fb9\u754c<\/li>\n
      • \u77e9\u5f62B\u7684\u4e0a\u8fb9\u754c\u5c0f\u4e8e\u77e9\u5f62A\u7684\u4e0b\u8fb9\u754c
        \u5982\u679c\u4ee5\u4e0a\u6761\u4ef6\u90fd\u4e0d\u6210\u7acb\uff0c\u5219\u77e9\u5f62\u76f8\u4ea4\u3002<\/li>\n<\/ul>\n
        \u5728Python\u4e2d\u53ef\u4ee5\u4f7f\u7528\u54ea\u4e9b\u5e93\u6765\u7b80\u5316\u77e9\u5f62\u76f8\u4ea4\u7684\u8ba1\u7b97\uff1f<\/strong>
        Python\u6709\u8bb8\u591a\u5e93\u53ef\u4ee5\u5e2e\u52a9\u7b80\u5316\u77e9\u5f62\u7684\u76f8\u4ea4\u8ba1\u7b97\uff0c\u6bd4\u5982Shapely\u548cPygame\u3002Shapely\u4e13\u6ce8\u4e8e\u51e0\u4f55\u5bf9\u8c61\u7684\u5904\u7406\uff0c\u63d0\u4f9b\u4e86\u975e\u5e38\u76f4\u89c2\u7684\u63a5\u53e3\u6765\u68c0\u67e5\u51e0\u4f55\u5f62\u72b6\u4e4b\u95f4\u7684\u5173\u7cfb\uff0c\u800cPygame\u5219\u9002\u5408\u7528\u4e8e\u6e38\u620f\u5f00\u53d1\uff0c\u80fd\u591f\u5904\u7406\u77e9\u5f62\u78b0\u649e\u68c0\u6d4b\u3002\u8fd9\u4e9b\u5e93\u90fd\u80fd\u5927\u5927\u51cf\u5c11\u624b\u52a8\u8ba1\u7b97\u7684\u590d\u6742\u6027\u3002<\/p>\n
        \u77e9\u5f62\u76f8\u4ea4\u7684\u5e94\u7528\u573a\u666f\u6709\u54ea\u4e9b\uff1f<\/strong>
        \u77e9\u5f62\u76f8\u4ea4\u7684\u68c0\u6d4b\u5728\u591a\u4e2a\u9886\u57df\u90fd\u6709\u5e7f\u6cdb\u7684\u5e94\u7528\uff0c\u5305\u62ec\u6e38\u620f\u5f00\u53d1\u4e2d\u7528\u4e8e\u68c0\u6d4b\u89d2\u8272\u4e0e\u7269\u4f53\u4e4b\u95f4\u7684\u78b0\u649e\uff0c\u56fe\u5f62\u7528\u6237\u754c\u9762\u4e2d\u7684\u5143\u7d20\u5e03\u5c40\uff0c\u8ba1\u7b97\u673a\u89c6\u89c9\u4e2d\u7684\u5bf9\u8c61\u68c0\u6d4b\u7b49\u3002\u8fd9\u4e9b\u5e94\u7528\u90fd\u9700\u8981\u9ad8\u6548\u4e14\u51c6\u786e\u7684\u76f8\u4ea4\u68c0\u6d4b\u7b97\u6cd5\uff0c\u4ee5\u786e\u4fdd\u7cfb\u7edf\u7684\u6027\u80fd\u548c\u7528\u6237\u4f53\u9a8c\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"Python \u5224\u65ad\u4e24\u4e2a\u77e9\u5f62\u662f\u5426\u76f8\u4ea4 \u5728Python\u4e2d\uff0c\u53ef\u4ee5\u901a\u8fc7\u6bd4\u8f83\u4e24\u4e2a\u77e9\u5f62\u7684\u8fb9\u754c\u6765\u5224\u65ad\u5b83\u4eec\u662f\u5426\u76f8\u4ea4\u3002\u5224\u65ad\u4e24\u4e2a\u77e9 […]","protected":false},"author":3,"featured_media":1103531,"comment_status":"closed","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[37],"tags":[],"acf":[],"_links":{"self":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1103518"}],"collection":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/comments?post=1103518"}],"version-history":[{"count":"1","href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1103518\/revisions"}],"predecessor-version":[{"id":1103532,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1103518\/revisions\/1103532"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/media\/1103531"}],"wp:attachment":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/media?parent=1103518"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/categories?post=1103518"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/tags?post=1103518"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}