java用递归算法编写求1~n的累加和 编写一个java程序,从键盘输入整数n,并计算从1到n的累加...
java\u4e2d\uff0c\u7528\u9012\u5f52\u51fd\u6570\u5b9e\u73b01\u5230N\u7684\u7d2f\u52a0import java.util.Scanner;
public class TestDiGui
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
int input = 0;
int show = 0;
System.out.println("\u8f93\u5165\u4e00\u4e2a\u6574\u6570n:");
input=sc.nextInt();
show = f(input);
System.out.println("\u7ed3\u679c\u4e3a:"+show);
}
static int f(int n)
{
int result = 0;
if(n==0)
{
result = 0;
return result;
}
if(n==1)
{
result = 1;
return result;
}
else
{
result = n+f(n-1);
return result;
}
}
}
//\u7f16\u5199\u4e00\u4e2a\u5b57\u7b26\u754c\u9762\u7684Java Application \u7a0b\u5e8f\uff0c\u63a5\u53d7\u7528\u6237\u4ece\u952e\u76d8\u8f93\u5165\u7684\u4e00\u4e2a\u6b63\u6574\u6570\uff0c\u7136\u540e\u7edf\u8ba1\u5e76\u8f93\u51fa\u4ece1\u5230\u8fd9\u4e2a\u6b63\u6574\u6570\u7684\u7d2f\u52a0\u548c\u3002
import java.awt.*;
import java.awt.event.*;
public class DS implements ActionListener
{
Frame f=new Frame("\u8f93\u5165\u6b63\u6574\u6570");
Label l=new Label("\u8bf7\u8f93\u5165\u6574\u6570");
Button b=new Button("\u786e\u5b9a");
TextField t=new TextField(20);
TextField t2=new TextField(20);
Label l1=new Label("\u7ed3\u679c\u4e3a");
DS(){
f.setLayout(new GridLayout(2,3));
f.add(l);
f.add(t);
f.add(b);
f.add(l1);
f.add(t2);
f.setSize(200,300);
f.setVisible(true);
t2.setEditable(false);
f.addWindowListener(new WindowAdapter(){
public void windowClosing(WindowEvent e){System.exit(0);}
});
b.addActionListener(this);
}
public void actionPerformed(ActionEvent e){
int k = Integer.valueOf(t.getText()).intValue();
int sum=0;
String s="";
for (int i=1;i<=k;i++)
{
sum=sum+i;
}
s=s+sum;
t2.setText(s);
}
public static void main(String args[]){
new DS();
}
}
import java.util.Scanner;
public class Zhi2{
public static void main(String[] args){
int number = 1;
int sum = 0;
int n;
Scanner scanner = new Scanner(System.in);
n = scanner.nextInt();
for (;number<=n;number++){
sum += number;
}
System.out.println(+sum);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
System.out.println(f(n));
}
public static int f(int n) {
if (n == 1)
return 1;
else {
return n + f(n - 1);
}
}
}
绛旓細public class App { // 涓诲嚱鏁 1+..100public static void main(String[] args){ int sum = add(100); System.out.println(sum);}// 鍔熻兘鍑芥暟addprivate static int add(int n){ return n > 0 ? n + add(n-1) : 0; }} ...
绛旓細public class ttt { public static int f(int n){ if(n==1){ return 1;} return n+f(n-1);} public static void main(String [] args){ System.out.print(ttt.f(100));} }
绛旓細package Test;//Test涓虹▼搴忔墍鍦ㄧ殑package鍚峱ublic class digui {private static int ADD( int n) {// TODO Auto-generated method stubif(n==1)return 1;else return n+ADD(n-1);}public static void main(String[] args) {int n=100,sum=0;sum=ADD(n);System.out.println(sum);}} ...
绛旓細瀹屾暣浠ｇ爜濡備笅锛屽鍒跺埌eclipse涓繍琛岋細public class Exam01 {// 涓嬮潰鐨勮繖涓柟娉鍒╃敤閫掑綊鐨勬柟娉曟眰闃朵箻public int getFac(int m) {if (m == 1) {return 1;} else {return m * getFac(m - 1);}}public static void main(String args[]) {Exam01 fac = new Exam01();// System.out....
绛旓細涓ょ鏂规硶锛涓绉嶇洿鎺ョ敤寰幆璁＄畻锛岀敤寰幆渚濇瀵1鍒n杩涜鍙犲姞锛屽叿浣撳涓嬶細public class Exos{ public static void main(String[] args){ int n = 10; int sum = 0; for(int i=0;i<n;i++){ sum = sum + i+1; } System.out.println("The sum is: " + sum); ...
绛旓細鍙嶅簭:void dfs(int n){ if(n == 0)return;鎵撳嵃 n;dfs(n-1);} 姝ｅ簭:void dfs(int n){ if(n == 0)return;dfs(n-1);鎵撳嵃 n;} 涓诲嚱鏁颁腑浼犻掔殑鍙傛暟灏辨槸 n 绠楁硶濡傛锛岃嚜宸辨敼鎴java鍚с
绛旓細include<stdio.h> int sum(int n){ if(n==1)//涓寸晫鐘舵 return 1;return n+sum(n-1);//閫掑綊 } int main(){ int n;while(~scanf("%d",&n))//杈撳叆n printf("%d\n",sum(n));return 0;}
绛旓細杩欐槸涓涓枑娉㈤偅濂戞暟鍒椼傞鍏堣澹版槑涓涓嚱鏁帮紝璁＄畻鏂愭尝閭ｅ鏁板垪鐨勶紝閫掑綊璁＄畻锛屽緢绠鍗曪紝鍋囪涓篺ibonacci(int number);number涓虹鍑犱釜鍊笺俤ouble sum = 0;for(int i = 1; i < 21; i++){ sum += fibonacci(i)/fibonacci(i+1);} static int fibonacci(int number){ if (n == 1 || n ==...
绛旓細_5 = _4 * 1.046; // 5 骞村悗System.out.println(_5);System.out.println(f(5));} // 鍙傛暟 n 琛ㄧず n 骞村悗public static double f(int n) { if (n == 0) {return 50000;}return f(n - 1) * 1.046;}}杈撳嚭缁撴灉锛氳緭鍑虹浉鍚岋紝璇存槑 f 灏辨槸浣犺鐨閫掑綊鏂规硶銆
绛旓細int MAX(int []array,int max,int index) //姹傛渶澶х殑閫掑綊 { if(index>array.lenth)return max;else if(array[index] >max)return MAX(array,array[index],index+1);else return MAX(array,max,index+1);} int SUM(int []array,int sum,int index){ //姹傚拰閫掑綊 if(index>array.lenth...
