在类中使用递归

本文介绍了在类中使用递归的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！

问题描述

限时送ChatGPT账号..

我正在为考试而练习，并试图解决这个问题.我只是不知道如何处理 add 方法.这是我目前所拥有的:

I'm practicing for an exam and trying to figure this out. I'm just not exactly what to do with the add method. This is what I have so far:

class recursion:
    def __init__(self, lst=[]):
        self.lst = lst

    def add(self, x, y):
        return x + y

    def recurs(self):
        if len(self.lst) == 1:
            return lst[0]
        else:
            return self.lst[0].add(self.recurs(lst[1:])

推荐答案

假设您正在尝试递归获取列表的总和:

Assuming you're trying to recursively get the sum of the list:

本质上，recursive_sum_helper 不断用较小的列表调用自己:

Essentially, recursive_sum_helper keeps calling itself with smaller lists:

sum(1, 2, 3, 4) = 1+sum(2,3,4) = 1+( 2 + sum(3,4) ) = ...

sum(1, 2, 3, 4) = 1+sum(2,3,4) = 1+( 2 + sum(3,4) ) = ...

class recursive_summer:
    def __init__(self, lst=[]):
        self.lst = lst
    def recursive_sum(self):
        return self.recursive_sum_helper(self.lst)
    def recursive_sum_helper(self, a_lst):
        if len(a_lst) == 1:
            return a_lst[0]
        else:
            first_element = a_lst[0]
            list_without_first_element = a_lst[1:]
            return first_element + self.recursive_sum_helper( list_without_first_element )

r = recursive_summer([1,2,3,4])
r.recursive_sum()

输出为 10.

希望这对您要解决的任何问题有所帮助.

Hope this helps with whatever problem you're trying to solve.

这篇关于在类中使用递归的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！