How do I strip down integers for future manipulation?

Ok, so here is the deal.

Part of an assignment is to take a long number like

1238398173987

and strip it down to
ints like 1 2 3 8 etc...

but we won't be using arrays since we did not learn this yet in class.

So my question is how would I separate the numbers?

Would using modulus do it? if so, would I have to declare all the individual ints?

I need to do this in order to then do various conditional statements to the integers and to add them up.

Suggestions are welcome, thank you.

Hi here is one way you could do it, and the create Integers from the individual results. You would probably need some validation to make sure the character is actually a numeric value. Hope it gives you some ideas.

Code:

---


public class StringSplit {
   
    public static void main(String[] args) {
        int toBeSplit = 123456;
        String string = Integer.toString(toBeSplit);
       
        for(int i = 0; i < string.length(); i++) {
            Integer integer = new Integer( Integer.valueOf( new Character(string.charAt(i)).toString() ) );
            System.out.println("int = " + integer.intValue());
        }
    }
}

---

Same idea.... remove this admin....

Hey sorry I was bored and just got home from work!

That's ok, i thought nobody gonna answer this thread at that moment.... My reply is just an algorithm of yours, so i removed it....

Usually, this kind of question needs a code, not an algo... :)

I was just bored and waiting to go out, I thought it looked like a nice quick problem to solve and I never had to do that before, but it still looked like fun.

If you wanted a fun way to do it just take powers of 10 from it.

Thank you for the suggestions everyone.

Quote:

---

Originally Posted by Zosden

If you wanted a fun way to do it just take powers of 10 from it.

---

Hi can you a give java code snippet, that would be helpful.

Yes, that would help. I tried doing it but all I got was the first number on the right, then the last TWO numbers on the right.

Here's one, returns an integer array containing all the digits of an integer in order.

Probably could be better though.

Code:

---


public int[] longSplit(int toSplit){
               
                LinkedList<Integer> ret=new LinkedList<Integer>();
               
                int tens=10;
                int j=0;
               
                while(tens<toSplit*10){
                        int prev=0;
                        for(int k=0;k<j;k++){
                                prev+=ret.get(k);
                        }
                        ret.add((toSplit%tens-prev)/(tens/10));
                        tens*=10;
                        j++;
                }
               
               
                int[] r=new int[ret.size()];
                for(int i=0;i<ret.size();i++){
                        r[i]=ret.get(i);
                }
               
                return r;
               
        }

---

That has got to be an easier way of doing this though.

Another nice way:

Code:

---

    public int[] intToArray(int number) {
            int size = (int) Math.ceil(Math.log10(number));
            int[] digits = new int[size];
            double aux = number;
            for (int i=size-1 ; i>=0 ; i--)
            {
                digits[i] = (int) aux%10;
                aux /= 10;
            }
            return digits;
    }

---

To print the result:

Code:

---

        for (int d : intToArray(61235437))
            System.out.print(d);

---

Ferran