[新手请教]关于python re.match的一个小问题，谢谢

代码:

class Node:
   def __init__(self):
      self.x = 0
      self.y = 0
      self.z = 0
   
   def Scan(self):
      self.x, self.y, self.z = raw_input().split()
   
   def __lt__(self, oth):
      return self.x < oth.x and self.y < oth.y and self.z < oth.z

def comp(a, b):
   return a.x < b.x

n = int(raw_input())
a = [Node() for i in range(0, n + 1)]
for i in range(1, n + 1):
   a[i].Scan()

a.sort(comp)

for i in range(1, n + 1):
   print a[i].x, a[i].y, a[i].z

代码:

def comp(a, b):
   return a.x - b.x