繁体   English   中英

有人可以帮助我理解这两段代码[递归]吗?

[英]Can someone help me understand these 2 pieces of code [Recursion]?

我很难理解这段代码中发生的事情。 在针对作业的14个问题中,这是我唯一遇到的两个问题,只是在不知道答案如何的情况下给出答案。 任何帮助,将不胜感激,谢谢。

这是#1:

public void printDollarSign(int k)
{
        int j;
        if (k>0)
        {
              for (j=1; j<= k; j++)
                  System.out.print("$");
              System.out.println();
              printDollarSign(k-1);
        }
}

如果调用是,输出将是什么:printDollarSign(5);

答案是:

$$$$$

$$$$

$$$

$$

$

这是#2:

public void bbb(String s, int p)
{
    if (p>= 0)
    { 
        bbb(s,p-1);
        System.out.print(s.charAt(p)); 
    }
}

如果调用是,输出将是什么:bbb(“ January”,4);

答案是:

亚努阿

printDollarSign的说明:

  • 在这里,您创建了一个递归函数。
  • 每个递归函数都有一个基本条件,在您的情况下是if(k> 0)。
  • 每个递归调用都会将k的值递减1.因此,对于每个递归调用,for循环运行的次数将减少1。

对于首次通话:

  1. 假设k = 5;
  2. 函数调用printDollarSign(5);
  3. 检查是否(k> 0)即5> 0;
  4. For循环运行5次并打印5个“ $”符号;
  5. println打印换行符;
  6. 递归调用printDollarSign(4);

printDollarSign(k)首先打印k个$,然后打印换行,然后调用printDollarSign(k-1)首先打印k-1个$,然后打印换行,然后调用printDollarSign(k -1-1)...一直持续到k = 0。 当k = 0时,printDollarSign(0)不打印任何内容。

您的第一个方法是创建一个带有int特定参数的函数,在本例中为“ k”。

  • 然后通过“ int k;”设置一个称为j的int。
  • 然后检查k是否大于0
  • 检查后,它遍历k(其中j = 1且j <k)并打印出“ $”符号
  • 它将产生“ $$$$$” ..“ $$$$” ..等,直到k <0
  • 然后编写新行,然后再次调用该函数,将k减1

码:

public void printDollarSign(int k){ //Define function
        int j;//Define j as an int
        if (k>0){//Check if k is greater than 0
             for (j=1; j<= k; j++)//Loop through k where j = 1
                 System.out.print("$");//Print $ by the amount of k
             System.out.println();//Print a new line
             printDollarSign(k-1);//Re run the function
        }
}

您的第二个问题是创建一个带有字符串和int“ s”和“ p”两个参数的函数

  • 它检查p是否大于0
  • 然后在内部调用该函数,并减去p(p-1)中的1
  • 然后根据p从字符串中打印出一个字符

码:

public void bbb(String s, int p){//Define Function
    if (p>= 0){ //Check if p is greater than 0
        bbb(s,p-1);//Rerun function
        System.out.print(s.charAt(p));//Print character of string based on p
    }
}

添加代码注释以进行解释:

1号

public void printDollarSign(int k)
    {
        // temporary variable j, it will be always initialized to 1 inside the for loop.
        int j;
        // only executed to be true if k is more than 0, that means if K is initially 5
        // then it only works for 5,4,3,2,1  and not for 0.
        if (k>0)
        {
            // always starts with 1 and goes to the value of k, that means if K is currently 5
            // then it will print 5 dollars, if 4 then 4 dollars and so on
            for (j=1; j<= k; j++)
                System.out.print("$");
            // a new line will be added once dollars are printed.
            System.out.println();
            // this will again call the same function and decrements the value of k, so next time 
            // k will have the value one less then the previous one, if this has printed 5 dollars 
            // in last iteration next time it will print 4 dollars and so on
            printDollarSign(k-1);
        }
    }

2号

public void bbb(String s, int p)
    {
        // only print a character if p has a value grater than 0. in you case , p has a value 4 that
        // mean only 4 characters will be printed at max
        if (p>= 0)
        { 
            // recuresively call same method by decrementing p, so it will be
            // [bbb(s,3) prints 'a']-> [bbb(s,3) prints 'u']-> bbb(s,2) [prints 'n']-> [bbb(s, 1) prints 'a']> [bbb(s, 0) prints 'J']
            // last character will be printed first
            bbb(s,p-1);
            // prints the character at p location
            System.out.print(s.charAt(p)); 
        }
    }

bbb的解释:

  • 递归的一种应用是从给定的字符串中提取子字符串。
  • 基本条件是否(p> = 0)。
  • 您应该意识到以下事实:对于每个递归调用,“ P”的值都存储在堆栈中。
  • 如您所知,堆栈是一个后进先出(LIFO)数据结构,插入堆栈中的最后一个值将首先弹出。

执行:

  1. bbb(“ January”,4); ->堆栈包含: [4]
  2. bbb(“ January”,3); ->堆栈包含: [3 4]
  3. bbb(“ January”,2); ->堆栈包含: [2 3 4]
  4. bbb(“ January”,1); ->堆栈包含: [1 2 3 4]
  5. bbb(“ January”,0); ->堆栈包含: [0 1 2 3 4]

现在弹出每个元素并在该位置打印字符

  1. 在0之后-> J
  2. 1之后-> Ja
  3. 2点后-> 1月
  4. 3之后-> Janu
  5. 4点后-> Janua
if you provide a string s as 'January', the way it stores is like this:
0th position = J, 
1th position = a,
2th position = n,
3th position = u,
4th position = a,
5th position = r,
6th position = y,
Just like an array of characters. 
When you provide p=4, you are setting the closing criteria for the condition    check. 

function bbb('January', 4){
if(4>=0){
bbb('January', 3); ....

function bbb('January', 3){
if(3>=0){
bbb('January', 2); ....

function bbb('January', 2){
if(2>=0){
bbb('January', 1); ....

function bbb('January', 1){
if(1>=0){
bbb('January', 0); ....

function bbb('January', 0){
if(0>=0){
bbb('January', -1); ....

function bbb('January', -1){
if(-1>=0){ Here condition check fails.. hence char at(-1) doec not print

return goes back to print of previous call and prints J as p=0, we have J
the p=1: a
p=2: n
p=3: u
p=4: a

功能完成...

请让我知道说明是否有帮助

暂无
暂无

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM