-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNumFinder.java
More file actions
66 lines (53 loc) · 1.88 KB
/
NumFinder.java
File metadata and controls
66 lines (53 loc) · 1.88 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
// import java.util.*;
// public class NumFinder {
// public static void main(String[] args) {
// int count = 0;
// int[] arr = { 12, 33, 43, 12, 22, 12, 56, 12, 30 };
// try (Scanner input = new Scanner(System.in)) {
// for (int i = 0; i < arr.length; i++) {
// System.out.println(arr[i]);
// }
// System.out.println("Enter the number whose repetition is to be found ");
// int n = input.nextInt();
// for (int i = 0; i < arr.length; i++) {
// if (arr[i] == n) {
// count++;
// }
// }
// }
// System.out.println(count);
// }
// }12
// ---------------------------------------------------------------------------------------------------------------------------
// import java.util.*;
// public class NumFinder {
// public static void main(String[] args) {
// int count = 0;
// int[] arr = {12, 33, 43, 12, 22, 12, 56, 12, 30};
// try (Scanner input = new Scanner(System.in)) {
// System.out.println("Array elements: " + Arrays.toString(arr)); // Print in one line
// System.out.print("Enter the number whose repetition is to be found: ");
// int n = input.nextInt();
// // Single loop for printing & counting occurrences
// for (int num : arr) {
// if (num == n) {
// count++;
// }
// }
// }
// System.out.println("Occurrences of " + count);
// }
// }
// import java.util.*;
public class NumFinder {
public static void main(String[] args) {
int num = 3456643;
int ans = 0;
while(num > 0) {
int rem = num % 10;
num = num/10;
ans = ans*10+rem;
}
System.out.println(ans);
}
}