Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int number; // = some int
- while (number > 0) {
- print( number % 10);
- number = number / 10;
- }
- 10012 % 10 = 2
- 10012 / 10 = 1001, remainder 2
- int number; // = and int
- LinkedList<Integer> stack = new LinkedList<Integer>();
- while (number > 0) {
- stack.push( number % 10 );
- number = number / 10;
- }
- while (!stack.isEmpty()) {
- print(stack.pop());
- }
- String number = String.valueOf(someInt);
- char[] digits1 = number.toCharArray();
- // or:
- String[] digits2 = number.split("(?<=.)");
- IntStream chars = number.chars();
- public static void printDigits(int num) {
- if(num / 10 > 0) {
- printDigits(num / 10);
- }
- System.out.printf("%d ", num % 10);
- }
- public static void main(String[] args) {
- Integer[] digits = getDigits(12345);
- System.out.println(Arrays.toString(digits));
- }
- public static Integer[] getDigits(int num) {
- List<Integer> digits = new ArrayList<Integer>();
- collectDigits(num, digits);
- return digits.toArray(new Integer[]{});
- }
- private static void collectDigits(int num, List<Integer> digits) {
- if(num / 10 > 0) {
- collectDigits(num / 10, digits);
- }
- digits.add(num % 10);
- }
- int num = 5542;
- String number = String.valueOf(num);
- for(int i = 0; i < number.length(); i++) {
- int j = Character.digit(number.charAt(i), 10);
- System.out.println("digit: " + j);
- }
- digit: 5
- digit: 5
- digit: 4
- digit: 2
- // could be any num this is a randomly generated one
- int num = (int) (Math.random() * 1000);
- // this will return each number to a int variable
- int num1 = num % 10;
- int num2 = num / 10 % 10;
- int num3 = num /100 % 10;
- // you could continue this pattern for 4,5,6 digit numbers
- // dont need to print you could then use the new int values man other ways
- System.out.print(num1);
- System.out.print("n" + num2);
- System.out.print("n" + num3);
- int[] intTab = String.valueOf(number).chars().map(Character::getNumericValue).toArray();
- int digits1 =Integer.parseInt( String.valueOf(201432014).substring(0,4));
- System.out.println("digits are: "+digits1);
- public static void recursion(int number) {
- if(number > 0) {
- recursion(number/10);
- System.out.printf("%d ", (number%10));
- }
- }
- Input: 12345
- Output: 1 2 3 4 5
- int year = sc.nextInt(), temp = year, count = 0;
- while (temp>0)
- {
- count++;
- temp = temp / 10;
- }
- double num = Math.pow(10, count-1);
- int i = (int)num;
- for (;i>0;i/=10)
- {
- System.out.println(year/i%10);
- }
- 1
- 2
- 3
- public static void reverseNumber2(int number) {
- int residual=0;
- residual=number%10;
- System.out.println(residual);
- while (residual!=number) {
- number=(number-residual)/10;
- residual=number%10;
- System.out.println(residual);
- }
- }
- int[] digits = intAsString.chars().map(i -> i - '0').toArray();
- String string = Integer.toString(1234);
- int[] digits = new int[string.length()];
- for(int i = 0; i<string.length(); ++i){
- digits[i] = Integer.parseInt(string.substring(i, i+1));
- }
- System.out.println("digits:" + Arrays.toString(digits));
- Scanner scanNumber = new Scanner(System.in);
- int userNum = scanNumber.nextInt(); // user's number
- // divides each digit into its own element within an array
- List<Integer> checkUserNum = new ArrayList<Integer>();
- while(userNum > 0) {
- checkUserNum.add(userNum % 10);
- userNum /= 10;
- }
- Collections.reverse(checkUserNum); // reverses the order of the array
- System.out.print(checkUserNum);
- public static boolean isPalindrome(int input) {
- List<Integer> intArr = new ArrayList();
- int procInt = input;
- int i = 0;
- while(procInt > 0) {
- intArr.add(procInt%10);
- procInt = procInt/10;
- i++;
- }
- int y = 0;
- int tmp = 0;
- int count = 0;
- for(int j:intArr) {
- if(j == 0 && count == 0) {
- break;
- }
- tmp = j + (tmp*10);
- count++;
- }
- if(input != tmp)
- return false;
- return true;
- }
- int number = 12344444; // or it Could be any valid number
- int temp = 0;
- int divider = 1;
- for(int i =1; i< String.valueOf(number).length();i++)
- {
- divider = divider * 10;
- }
- while (divider >0) {
- temp = number / divider;
- number = number % divider;
- System.out.print(temp +" ");
- divider = divider/10;
- }
- int num= 4321
- int first = num % 10;
- int second = ( num - first ) % 100 / 10;
- int third = ( num - first - second ) % 1000 / 100;
- int fourth = ( num - first - second - third ) % 10000 / 1000;
- public int[] getDigitsOfANumber(int number) {
- String numStr = String.valueOf(number);
- int retArr[] = new int[numStr.length()];
- for (int i = 0; i < numStr.length(); i++) {
- char c = numStr.charAt(i);
- int digit = c;
- int zero = (char) '0';
- retArr[i] = digit - zero;
- }
- return retArr;
- }
- int size=i.toString().length(); // the length of the integer (i) we need to split;
- ArrayList<Integer> li = new ArrayList<Integer>(); // an ArrayList in whcih to store the resulting digits
- Boolean b=true; // control variable for the loop in which we will reatrive step by step the digits
- String number="1"; // here we will add the leading zero depending on the size of i
- int temp; // the resulting digit will be kept by this temp variable
- for (int j=0; j<size; j++){
- number=number.concat("0");
- }
- Integer multi = Integer.valueOf(number); // the variable used for dividing step by step the number we received
- while(b){
- multi=multi/10;
- temp=i/(multi);
- li.add(temp);
- i=i%(multi);
- if(i==0){
- b=false;
- }
- }
- for(Integer in: li){
- System.out.print(in.intValue()+ " ");
- }
- List<Integer> digits = digitsInString.chars().map(Character::getNumericValue)
- .collect(Collectors.toList());
- public static char[] getTheDigits(int value){
- String str = "";
- int number = value;
- int digit = 0;
- while(number>0){
- digit = number%10;
- str = str + digit;
- System.out.println("Digit:" + digit);
- number = number/10;
- }
- return str.toCharArray();
- }
- public int[] getDigitsOf(int num)
- {
- int digitCount = Integer.toString(num).length();
- if (num < 0)
- digitCount--;
- int[] result = new int[digitCount];
- while (digitCount-- >0) {
- result[digitCount] = num % 10;
- num /= 10;
- }
- return result;
- }
- int number = 12345;
- int[] digits = getDigitsOf(number);
- for (int i = 0; i < digits.length; i++) {
- System.out.println(digits[i]);
- }
- int number = 12345;
- for (int i = 0; i < getDigitsOf(number).length; i++) {
- System.out.println( getDigitsOf(number)[i] );
- }
- public int digitsToInt(int[] digits)
- {
- int digitCount = digits.length;
- int result = 0;
- for (int i = 0; i < digitCount; i++) {
- result = result * 10;
- result += digits[i];
- }
- return result;
- }
- import java.util.Scanner;
- class Test
- {
- public static void main(String[] args)
- {
- Scanner sc = new Scanner(System.in);
- int num=sc.nextInt();
- System.out.println("Enter a number (-1 to end):"+num);
- int result=0;
- int i=0;
- while(true)
- {
- int n=num%10;
- if(n==-1){
- break;
- }
- i++;
- System.out.println("Digit"+i+" = "+n);
- result=result*10+n;
- num=num/10;
- if(num==0)
- {
- break;
- }
- }
- }
- }
- public static void main(String[] args) {
- System.out.println("Digits Array:: "+Arrays.toString(getNumberArr(1100)));
- }
- private static Integer[] getNumberArr(int number) {
- //will get the total number of digits in the number
- int temp = number;
- int counter = 0;
- while (temp > 0) {
- temp /= 10;
- counter++;
- }
- //reset the temp
- temp = number;
- // make an array
- int modulo; //modulo is equivalent to single digit of the number.
- Integer[] numberArr = new Integer[counter];
- for (int i = counter - 1; i >= 0; i--) {
- modulo = temp % 10;
- numberArr[i] = modulo;
- temp /= 10;
- }
- return numberArr;
- }
- Digits Array:: [1, 1, 0, 0]
- import java.util.Scanner;
- public class SeparatingDigits {
- public static void main( String[] args )
- {
- System.out.print( "Enter the digit to print separately :- ");
- Scanner scan = new Scanner( System.in );
- int element1 = scan.nextInt();
- int divider;
- if( ( element1 > 9999 ) && ( element1 <= 99999 ) )
- {
- divider = 10000;
- }
- else if( ( element1 > 999 ) && ( element1 <= 9999 ) )
- {
- divider = 1000;
- }
- else if ( ( element1 > 99) && ( element1 <= 999 ) )
- {
- divider = 100;
- }
- else if( ( element1 > 9 ) && ( element1 <= 99 ) )
- {
- divider = 10;
- }
- else
- {
- divider = 1;
- }
- quotientFinder( element1, divider );
- }
- public static void quotientFinder( int elementValue, int dividerValue )
- {
- for( int count = 1; dividerValue != 0; count++)
- {
- int quotientValue = elementValue / dividerValue ;
- elementValue = elementValue % dividerValue ;
- System.out.printf( "%d ", quotientValue );
- dividerValue /= 10;
- }
- }
- }
Add Comment
Please, Sign In to add comment