Update EulersFunction.java

yanglbme · web-flow · commit 12215a11d3b7 · 2019-02-04T11:27:42.000+08:00
diff --git a/Others/EulersFunction.java b/Others/EulersFunction.java
@@ -1,6 +1,7 @@
-//You can read more about Euler's totient function https://en.wikipedia.org/wiki/Euler%27s_totient_function
+// You can read more about Euler's totient function 
+// https://en.wikipedia.org/wiki/Euler%27s_totient_function
 public class EulersFunction {
-    //This method returns us number of x that (x < n) and gcd(x, n) == 1 in O(sqrt(n)) time complexity;
+    // This method returns us number of x that (x < n) and gcd(x, n) == 1 in O(sqrt(n)) time complexity;
     public static int getEuler(int n) {
         int result = n;
         for (int i = 2; i * i <= n; i++) {
@@ -13,7 +14,7 @@ public static int getEuler(int n) {
         return result;
     }
     public static void main(String[] args) {
-        for(int i = 1; i < 100; i++) {
+        for (int i = 1; i < 100; i++) {
             System.out.println(getEuler(i));
         }
     }

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,7 @@`
`1`		`-//You can read more about Euler's totient function https://en.wikipedia.org/wiki/Euler%27s_totient_function`
	`1`	`+// You can read more about Euler's totient function`
	`2`	`+// https://en.wikipedia.org/wiki/Euler%27s_totient_function`
`2`	`3`	`public class EulersFunction {`
`3`		`- //This method returns us number of x that (x < n) and gcd(x, n) == 1 in O(sqrt(n)) time complexity;`
	`4`	`+ // This method returns us number of x that (x < n) and gcd(x, n) == 1 in O(sqrt(n)) time complexity;`
`4`	`5`	`public static int getEuler(int n) {`
`5`	`6`	`int result = n;`
`6`	`7`	`for (int i = 2; i * i <= n; i++) {`
`@@ -13,7 +14,7 @@ public static int getEuler(int n) {`
`13`	`14`	`return result;`
`14`	`15`	`}`
`15`	`16`	`public static void main(String[] args) {`
`16`		`- for(int i = 1; i < 100; i++) {`
	`17`	`+ for (int i = 1; i < 100; i++) {`
`17`	`18`	`System.out.println(getEuler(i));`
`18`	`19`	`}`
`19`	`20`	`}`