class dd: aa = 100 def aa(self) -> object: print("hello word!") s1 = dd() s1.aa() print(s1.aa)

这段代码有一些语法错误，需要进行修正。首先，应该将类中的方法缩进，因为它是类的一部分。其次，类中的属性和方法不能同名，否则会导致冲突。最后，调用方法时应该加上括号，否则会输出方法的内存地址。

修正后的代码应该如下所示：

class dd:
    aa = 100
    def bb(self) -> object:
        print("hello word!")

s1 = dd()
s1.bb()
print(s1.bb())

输出结果为：

hello word!
hello word!
None

其中第一个输出是调用方法时输出的字符串，第二个输出是方法执行完毕后返回的空值，即`None`。

相关问题

约瑟夫环改错class Node: def __init__(self,data): self.data=data self.next=Noneclass linklist: def __init__(self): self.head=None self.data=None def isEmpty(self): if self.head: return False else: return True def length(self): if self.isEmpty(): return 0 else: t = self.head n = 1 while t.next: if t.next == self.head: break t = t.next n = n + 1 return n def addhead(self,data): node = Node(data) if self.isEmpty(): self.head = node self.tail = self.head else: node.next = self.head self.head = node self.tail.next = self.head def addtail(self,data): node=Node(data) if self.isEmpty(): self.addhead(data) else: t=self.head n=1 l=self.length() while n<l: n=n+1 t=t.next t.next=node node.next=self.head self.tail=node def delete(self,index): if self.isEmpty(): print("The linked list is empty") else: t = self.head l = self.length() if index == 0: self.head = t.next self.tail.next = self.head elif index == l - 1: n = 1 while n < l - 1: t = t.next n = n + 1 t.next = self.head self.tail = t elif index > l - 1: print("Out of range") elif index < 0: print("Wrong operation") else: n = 1 while n < index - 1: t = t.next n = n + 1 a = t.next.next t.next = a def insert(self,data,index): l = self.length() if index == 0 or self.isEmpty(): self.addhead(data) elif index >= l: self.addtail(data) else: node = Node(data) t = self.head n = 1 while n < index - 1: t = t.next n = n + 1 a = t.next t.next = node node.next = a def search(self,a): t=self.head for i in range(a): t=t.next return t.data def form(self,datalist): self.addhead(datalist[0]) for i in range(1,len(datalist)): self.addtail(datalist[i]) t = self.head while t.next != self.head: t = t.nextn,p=map(int,input().split(' '))data=[]p=p-1for i in range(1,n+1): data.append(i)print(data)datalist=[]for i in range(len(data)): datalist.append(int(data[i]))link=linklist()link.form(datalist)a=pb=[]while link.length()>0: b.append(link.search(a)) link.delete(a) a=a+p while a>=link.length(): a=a-link.length()print(b)

改错如下：

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

class LinkList:
    def __init__(self):
        self.head = None
        self.tail = None
    
    def isEmpty(self):
        if self.head:
            return False
        else:
            return True
    
    def length(self):
        if self.isEmpty():
            return 0
        else:
            t = self.head
            n = 1
            while t.next:
                if t.next == self.head:
                    break
                t = t.next
                n += 1
            return n
    
    def addhead(self, data):
        node = Node(data)
        if self.isEmpty():
            self.head = node
            self.tail = self.head
        else:
            node.next = self.head
            self.head = node
            self.tail.next = self.head
    
    def addtail(self, data):
        node = Node(data)
        if self.isEmpty():
            self.addhead(data)
        else:
            t = self.head
            n = 1
            l = self.length()
            while n < l:
                n += 1
                t = t.next
            t.next = node
            node.next = self.head
            self.tail = node
    
    def delete(self, index):
        if self.isEmpty():
            print("The linked list is empty")
        else:
            t = self.head
            l = self.length()
            if index == 0:
                self.head = t.next
                self.tail.next = self.head
            elif index == l - 1:
                n = 1
                while n < l - 1:
                    t = t.next
                    n += 1
                t.next = self.head
                self.tail = t
            elif index > l - 1:
                print("Out of range")
            elif index < 0:
                print("Wrong operation")
            else:
                n = 1
                while n < index:
                    t = t.next
                    n += 1
                a = t.next.next
                t.next = a
    
    def insert(self, data, index):
        l = self.length()
        if index == 0 or self.isEmpty():
            self.addhead(data)
        elif index >= l:
            self.addtail(data)
        else:
            node = Node(data)
            t = self.head
            n = 1
            while n < index:
                t = t.next
                n += 1
            a = t.next
            t.next = node
            node.next = a
    
    def search(self, a):
        t = self.head
        for i in range(a):
            t = t.next
        return t.data
    
    def form(self, datalist):
        self.addhead(datalist[0])
        for i in range(1, len(datalist)):
            self.addtail(datalist[i])
        t = self.head
        while t.next != self.head:
            t = t.next

n, p = map(int, input().split(' '))
data = [i for i in range(1, n+1)]
print(data)

datalist = []
for i in range(len(data)):
    datalist.append(data[i])

link = LinkList()
link.form(datalist)

a = p-1
b = []
while link.length() > 0:
    b.append(link.search(a))
    link.delete(a)
    a += p-1
    while a >= link.length():
        a -= link.length()

print(b)

class student(): def __init__(self,score): self.score=score def grade(self): if self.score>=90: print(4.0) elif self.score>=86: print(3.7) elif self.score>=83: print(3.3) elif self.score>=80: print(3.0) elif self.score>=76: print(2.7) elif self.score>=73: print(2.3) elif self.score>=70: print(2.0) elif self.score>=66: print(1.7) elif self.score>=63: print(1.3) elif self.score>=60: print(1.0) else: print(0) sc=int(input()) print(stu.grade())为什么这里会打印出None来！！！

你的代码中存在一个问题，即在 `print(stu.grade())` 中，你使用了 `stu` 而不是 `student`。另外，你也没有先创建一个学生对象，所以你需要先创建一个学生对象并将其分数传递给对象。修改后的代码如下：

class Student():
    def __init__(self, score):
        self.score = score

    def grade(self):
        if self.score >= 90:
            return 4.0
        elif self.score >= 86:
            return 3.7
        elif self.score >= 83:
            return 3.3
        elif self.score >= 80:
            return 3.0
        elif self.score >= 76:
            return 2.7
        elif self.score >= 73:
            return 2.3
        elif self.score >= 70:
            return 2.0
        elif self.score >= 66:
            return 1.7
        elif self.score >= 63:
            return 1.3
        elif self.score >= 60:
            return 1.0
        else:
            return 0

score = int(input("请输入学生成绩："))
stu = Student(score)
print(stu.grade())

这样就能够正确输出学生的成绩了。注意，我修改了 `grade` 方法中的 `print` 语句为 `return` 语句，并在 `print(stu.grade())` 中使用了 `return` 返回的成绩。