编写代码利用稀疏矩阵的链式存储实现稀疏矩阵的加，减，乘，转置等简单运算

以下是Python语言实现的稀疏矩阵加、减、乘、转置运算的代码，其中使用三元组的链式存储结构：

class Node:
    def __init__(self, i, j, value):
        self.i = i
        self.j = j
        self.value = value
        self.next = None

class SparseMatrix:
    def __init__(self, row, col):
        self.row = row
        self.col = col
        self.head = None

    def insert(self, i, j, value):
        if i < 0 or i >= self.row or j < 0 or j >= self.col:
            print("Index out of range")
            return
        new_node = Node(i, j, value)
        if self.head is None:
            self.head = new_node
            return
        cur = self.head
        pre = None
        while cur and cur.i < i:
            pre = cur
            cur = cur.next
        while cur and cur.i == i and cur.j < j:
            pre = cur
            cur = cur.next
        if cur and cur.i == i and cur.j == j:
            cur.value += value
            if cur.value == 0:
                if pre is None:
                    self.head = cur.next
                else:
                    pre.next = cur.next
            return
        if pre is None:
            self.head = new_node
        else:
            pre.next = new_node
        new_node.next = cur

    def add(self, other):
        if self.row != other.row or self.col != other.col:
            print("Invalid operation")
            return None
        res = SparseMatrix(self.row, self.col)
        cur1 = self.head
        cur2 = other.head
        while cur1 and cur2:
            if cur1.i < cur2.i or (cur1.i == cur2.i and cur1.j < cur2.j):
                res.insert(cur1.i, cur1.j, cur1.value)
                cur1 = cur1.next
            elif cur1.i > cur2.i or (cur1.i == cur2.i and cur1.j > cur2.j):
                res.insert(cur2.i, cur2.j, cur2.value)
                cur2 = cur2.next
            else:
                res.insert(cur1.i, cur1.j, cur1.value + cur2.value)
                cur1 = cur1.next
                cur2 = cur2.next
        while cur1:
            res.insert(cur1.i, cur1.j, cur1.value)
            cur1 = cur1.next
        while cur2:
            res.insert(cur2.i, cur2.j, cur2.value)
            cur2 = cur2.next
        return res

    def subtract(self, other):
        if self.row != other.row or self.col != other.col:
            print("Invalid operation")
            return None
        res = SparseMatrix(self.row, self.col)
        cur1 = self.head
        cur2 = other.head
        while cur1 and cur2:
            if cur1.i < cur2.i or (cur1.i == cur2.i and cur1.j < cur2.j):
                res.insert(cur1.i, cur1.j, cur1.value)
                cur1 = cur1.next
            elif cur1.i > cur2.i or (cur1.i == cur2.i and cur1.j > cur2.j):
                res.insert(cur2.i, cur2.j, -cur2.value)
                cur2 = cur2.next
            else:
                res.insert(cur1.i, cur1.j, cur1.value - cur2.value)
                cur1 = cur1.next
                cur2 = cur2.next
        while cur1:
            res.insert(cur1.i, cur1.j, cur1.value)
            cur1 = cur1.next
        while cur2:
            res.insert(cur2.i, cur2.j, -cur2.value)
            cur2 = cur2.next
        return res

    def multiply(self, other):
        if self.col != other.row:
            print("Invalid operation")
            return None
        res = SparseMatrix(self.row, other.col)
        cur1 = self.head
        while cur1:
            cur2 = other.head
            while cur2:
                if cur1.j == cur2.i:
                    res.insert(cur1.i, cur2.j, cur1.value * cur2.value)
                cur2 = cur2.next
            cur1 = cur1.next
        return res

    def transpose(self):
        res = SparseMatrix(self.col, self.row)
        cur = self.head
        while cur:
            res.insert(cur.j, cur.i, cur.value)
            cur = cur.next
        return res

    def print_matrix(self):
        for i in range(self.row):
            for j in range(self.col):
                cur = self.head
                while cur and cur.i < i:
                    cur = cur.next
                while cur and cur.i == i and cur.j < j:
                    cur = cur.next
                if cur and cur.i == i and cur.j == j:
                    print(cur.value, end=" ")
                else:
                    print(0, end=" ")
            print()

在上述代码中，SparseMatrix 类表示稀疏矩阵，Node 类表示三元组链表中的节点。insert 方法用于向稀疏矩阵中插入一个元素；add 方法用于实现稀疏矩阵加法；subtract 方法用于实现稀疏矩阵减法；multiply 方法用于实现稀疏矩阵乘法；transpose 方法用于实现稀疏矩阵转置；print_matrix 方法用于输出稀疏矩阵。