Shulou(Shulou.com)06/03 Report--

This article shows you how to understand Java recursion and 1-2-3 +. + n example, the content is concise and easy to understand, it can definitely brighten your eyes. I hope you can get something through the detailed introduction of this article.

Java Recursive Sum 1-2-3-N.

Public class Sum {public static int count (int n) {if (n > 1) {return count (n-1) + n;} else {return n;}} public static void main (String [] args) {System.out.println (Sum.count (100));}}

Extended learning

Enter a number:

four

ten

Code:

Public class Demo1 {public static void main (String [] args) {System.out.print ("Please enter a number:"); Scanner sc = new Scanner (System.in); int n = sc.nextInt (); Sum (n); System.out.println (Sum (n));} private static int Sum (int n) {if (n = 0) {return 0;} return Sum (n-1) + n;}}

Train of thought:

The sum of the first n numbers is equal to the n-1 number + n

The above content is how to understand the Java recursive sum of 1-2-3 +. + n example, have you learned any knowledge or skills? If you want to learn more skills or enrich your knowledge reserve, you are welcome to follow the industry information channel.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.