Question

我正在编写一个允许用户输入数字n的GUI程序，并从那里开始计算数字序列中的第n个项。他们可以选择使用迭代或递归方法。最后，当用户关闭窗口时，它应该创建一个新的文本文档，其中包含第n个术语，迭代方法的效率，以及前十个术语中每行的递归方法的效率。

我遇到的问题是效率计数器。它应该在使用任何一种方法时返回效率，但是当我在更改值或切换方法后单击计算按钮时，它会不断添加到效率计数器，而不是重置。我知道这是因为我的效率变量是静态的，但我的教授要求我的方法也是静态的。我该如何解决这个问题？

这是我的GUI文件

//Matt Edwards

import javax.swing.*;
import java.awt.*;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.awt.event.WindowAdapter;
import java.awt.event.WindowEvent;
import java.io.*;
import java.util.*;

    public class recursiveGUI extends JPanel 
   { 
   int counterEfficiency;
   private JFrame frame;//The frame
   private JPanel panel;//The panel
   private JRadioButton iterative;
   private JRadioButton recursive;
   private JLabel enter;
   private JTextField enter2;
   private JButton compute;
   private JLabel result;
   private JTextField result2;
   private JLabel efficiency;
   private JTextField efficiency2;
   private ButtonGroup radioButtons;
   public recursiveGUI()
   {


       frame=new JFrame("Project 3");
       panel=new JPanel();
       iterative=new JRadioButton("Iterative");
       recursive=new JRadioButton("Recursive");
       enter=new JLabel("Enter n");
       enter2=new JTextField("");
       compute=new JButton("Compute");
       result=new JLabel("Results");
       result2=new JTextField("");
       efficiency=new JLabel("Efficiency");
       efficiency2=new JTextField("");
       radioButtons=new ButtonGroup();

       //frame.addWindowListener(new WindowAdapter(){
          // public void windowClosed(WindowEvent e){

              // PrintWriter outFile=new PrintWriter(new File("efficienctResults.txt"));
               //for(int n=0;n<=10;n++)
               //{
                  // outFile.println(n+","+));
               //}

           //}

       //}


       compute.addActionListener(new ActionListener(){
           public void actionPerformed(ActionEvent e){
               int n;

               if(iterative.isSelected())
               {
                   String input=enter2.getText();
                   n=Integer.parseInt(input);
                   result2.setText(Integer.toString(Sequence.computeIterative(n)));
                   efficiency2.setText(Integer.toString(Sequence.getEfficiency()));

               }

               else if(recursive.isSelected())
               {
                   String input=enter2.getText();
                   n=Integer.parseInt(input);
                   result2.setText(Integer.toString(Sequence.computeRecursive(n)));
                   efficiency2.setText(Integer.toString(Sequence.getEfficiency()));
               }

           }
       });


       //Adding the parts together
       panel.setLayout(new GridLayout(6,2));
       radioButtons.add(iterative);
       radioButtons.add(recursive);
       panel.add(new JLabel());panel.add(iterative);
       panel.add(new JLabel());panel.add(recursive);

       panel.add(enter);panel.add(enter2);
       panel.add(new JLabel());panel.add(compute);
       panel.add(result);panel.add(result2);
       panel.add(efficiency);panel.add(efficiency2);
       frame.add(panel);
       frame.pack();
       frame.setLocationRelativeTo(null);
       frame.setSize(600,300);
       frame.setBackground(Color.red);
       frame.setVisible(true);

   }           






   //Main method
   public static void main(String[] args)
   {
       recursiveGUI myGUI=new recursiveGUI();
   }
}

这是我方法的文件

public class Sequence
{
static int efficiency;
public static int computeIterative(int n)
{
    int result = 0;
    if(n==0)
    {
        result=0;
    }
    else if(n==1)
    {
        result=1;
    }
    else
    {
        int first=1;
        int second=0;
        for(int i=2;i<=n;i++)
        {
            efficiency++;
            result=2*second+first;
            second=first;
            first=result;

        }
    }
    return result;


}

public static int computeRecursive(int n)
{
    int result=0;
    efficiency++;
    if(n==0)
    {
        result=0;
    }
    else if(n==1)
    {
        result=1;
    }
    else
    {
        result=2*computeRecursive(n-1)+computeRecursive(n-2);
    }
    return result;
}

public static int getEfficiency()
{
    return efficiency;
}

public static void main(String[] args)
{
    computeIterative(5);
}

}

Answer 1

您可以在检索之前简单地重置效率，例如：

public static int getEfficiency()
{
    int result = efficiency;

    efficiency = 0;

    return result;
}

效率计数器不会重置

1 个答案: