python实现单链表中删除倒数第K个节点的方法

class  edListAlgorithms( ):
 def __init__(self):
  pass

 def rm_last_kth_node(self, k,  ed_list): # 删除倒数第 K 个节点，针对单链表的
  if  ed_list.is_empty():
   print 'The given  ed_list is empty.'
  if k < 1 or k >  ed_list.get_length():
   print 'Wrong kth number out of index.'
  k =  ed_list.get_length() - k
  if k == 0:
   p =  ed_list.head
    ed_list.head = p.next
  else:
   p =  ed_list.head
   for i in xrange(k-1):
    p = p.next
   p.next = p.next.next