How to replace single element of array

Question

I will have a series of random arrays similar to.

array1[] = {1,2,3,0,0,5,6}
array1[] = {1,2,0,0,4,5,6}

I want them to end up like, so I replace the first 0 with X.

array1[] = {1,2,3,X,0,5,6}
array1[] = {1,2,X,0,4,5,6}

the code I'm using replaces all zeroes giving instead of just one.

array1[] = {1,2,3,X,X,5,6}
array1[] = {1,2,X,X,4,5,6}

Which isn't what I'm looking for. I'd be happy just replacing either one but only one. The code I'm using,

for(int i=0; i<array.length; i++){
        if(fruit[i] == 0)
            fruit[i]=X;
    }

Hope that was clear, thanks for any help! Being stuck at this for a little while now.

docs.oracle.com/javase/tutorial/java/nutsandbolts/branch.html — HelloWorld123456789
– HelloWorld123456789, Commented Jul 27, 2014 at 9:22
I've also tried to sort the array so the first element is 0 and then it's easy to replace but that doesn't work when X is a negative number, which it will be sometimes in this case. — Dodo
– Dodo, Commented Jul 27, 2014 at 9:22
I see no need to downvote this question. Despite it's simple answer Dodo has clearly put some work in here to describe it properly. So +1 for good formulated quertion. — Scheintod
– Scheintod, Commented Jul 27, 2014 at 11:55
(But don't forget to accept the ansert!) (the green checkmark left to the correct answer's rating) — Scheintod
– Scheintod, Commented Jul 27, 2014 at 11:58

Unihedron · Accepted Answer · 2014-07-27 09:24:25Z

2

Try using break.

for(int i = 0; i < array.length; i++) {
    if(fruit[i] == 0) {
        fruit[i] = X;
        break;
    }
}

This will ensure only one is changed, max.

Unihedron

11.1k13 gold badges65 silver badges72 bronze badges

answered Jul 27, 2014 at 9:21

David Xu

5,6154 gold badges30 silver badges51 bronze badges

Sign up to request clarification or add additional context in comments.

2 Comments

thanks! I tried this earlier but I forgot the curly brackets in the if statement.. feel like an idiot but glad it's sorted. Thanks!

@Dodo Don't forget to accepot the answer :).