ArrayList Item index is incorrect: Reversing a ArrayList with Recursion
up vote
0
down vote
favorite
I'm working on a small problem to reverse a ArrayList of Characters using recusion. I've got it mostly figured out but am currently having some issues with retrieving a item by it's index.
My function is as follows:
public static ArrayList<Character> reverseArray(ArrayList<Character> array)
if (array.size() == 1)
return array;
// Fetched the last item
ArrayList<Character> lastItem = new ArrayList<Character>();
System.out.println("Index: " + (array.size()-1));
System.out.println("Item at index: "+ (array.size()-1) + "is: " + array.get((array.size()-1)));
lastItem.add(array.get(array.size()-1));
// Remove the last item
array.remove(array.get(array.size()-1));
// Join all arrays until the last entry
lastItem.addAll(reverseArray(array));
return lastItem;
Running the below array list throught the function:
ArrayList<Character> test1 = new ArrayList<Character>();
test1.add('a');
test1.add('b');
test1.add('c');
test1.add('a');
test1.add('b');
test1.add('c');
The output in the console appears to be: [c, c, b, b, a, a]
I added some console prints to see what was happening, at index 5 it appears to pull the item at index 2. So through to the end it removes index 5 then 2, then 3 then 1. Changing the input array to not have duplicate values makes the function work. It appears to be an issue of having multiples of the same character.
Any ideas to why this would be happening?
java recursion
add a comment |
up vote
0
down vote
favorite
I'm working on a small problem to reverse a ArrayList of Characters using recusion. I've got it mostly figured out but am currently having some issues with retrieving a item by it's index.
My function is as follows:
public static ArrayList<Character> reverseArray(ArrayList<Character> array)
if (array.size() == 1)
return array;
// Fetched the last item
ArrayList<Character> lastItem = new ArrayList<Character>();
System.out.println("Index: " + (array.size()-1));
System.out.println("Item at index: "+ (array.size()-1) + "is: " + array.get((array.size()-1)));
lastItem.add(array.get(array.size()-1));
// Remove the last item
array.remove(array.get(array.size()-1));
// Join all arrays until the last entry
lastItem.addAll(reverseArray(array));
return lastItem;
Running the below array list throught the function:
ArrayList<Character> test1 = new ArrayList<Character>();
test1.add('a');
test1.add('b');
test1.add('c');
test1.add('a');
test1.add('b');
test1.add('c');
The output in the console appears to be: [c, c, b, b, a, a]
I added some console prints to see what was happening, at index 5 it appears to pull the item at index 2. So through to the end it removes index 5 then 2, then 3 then 1. Changing the input array to not have duplicate values makes the function work. It appears to be an issue of having multiples of the same character.
Any ideas to why this would be happening?
java recursion
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I'm working on a small problem to reverse a ArrayList of Characters using recusion. I've got it mostly figured out but am currently having some issues with retrieving a item by it's index.
My function is as follows:
public static ArrayList<Character> reverseArray(ArrayList<Character> array)
if (array.size() == 1)
return array;
// Fetched the last item
ArrayList<Character> lastItem = new ArrayList<Character>();
System.out.println("Index: " + (array.size()-1));
System.out.println("Item at index: "+ (array.size()-1) + "is: " + array.get((array.size()-1)));
lastItem.add(array.get(array.size()-1));
// Remove the last item
array.remove(array.get(array.size()-1));
// Join all arrays until the last entry
lastItem.addAll(reverseArray(array));
return lastItem;
Running the below array list throught the function:
ArrayList<Character> test1 = new ArrayList<Character>();
test1.add('a');
test1.add('b');
test1.add('c');
test1.add('a');
test1.add('b');
test1.add('c');
The output in the console appears to be: [c, c, b, b, a, a]
I added some console prints to see what was happening, at index 5 it appears to pull the item at index 2. So through to the end it removes index 5 then 2, then 3 then 1. Changing the input array to not have duplicate values makes the function work. It appears to be an issue of having multiples of the same character.
Any ideas to why this would be happening?
java recursion
I'm working on a small problem to reverse a ArrayList of Characters using recusion. I've got it mostly figured out but am currently having some issues with retrieving a item by it's index.
My function is as follows:
public static ArrayList<Character> reverseArray(ArrayList<Character> array)
if (array.size() == 1)
return array;
// Fetched the last item
ArrayList<Character> lastItem = new ArrayList<Character>();
System.out.println("Index: " + (array.size()-1));
System.out.println("Item at index: "+ (array.size()-1) + "is: " + array.get((array.size()-1)));
lastItem.add(array.get(array.size()-1));
// Remove the last item
array.remove(array.get(array.size()-1));
// Join all arrays until the last entry
lastItem.addAll(reverseArray(array));
return lastItem;
Running the below array list throught the function:
ArrayList<Character> test1 = new ArrayList<Character>();
test1.add('a');
test1.add('b');
test1.add('c');
test1.add('a');
test1.add('b');
test1.add('c');
The output in the console appears to be: [c, c, b, b, a, a]
I added some console prints to see what was happening, at index 5 it appears to pull the item at index 2. So through to the end it removes index 5 then 2, then 3 then 1. Changing the input array to not have duplicate values makes the function work. It appears to be an issue of having multiples of the same character.
Any ideas to why this would be happening?
java recursion
java recursion
asked Nov 10 at 4:27
Benjamin Stark
257
257
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
up vote
1
down vote
accepted
You are calling the overloaded version of remove that taken the element to be removed.
When you remove c, the third element gets removed. So, on the next recursive call, the last element (c) remains.
You need to remove the element by position
array.remove(array.size() - 1);
Perfect! I didn't catch that. Thanks very much.
– Benjamin Stark
Nov 10 at 4:55
add a comment |
up vote
0
down vote
I think you do it in wrong manner. You create too many useless temporary arrays. You just need just replace respective elements in ArrayList.
public static void reverseArray(List<Character> arr, int pos)
if (arr.isEmpty())
return;
int index = arr.size() - pos - 1;
if (pos >= index)
return;
char ch = arr.get(pos);
arr.set(pos, arr.get(index));
arr.set(index, ch);
reverseArray(arr, ++pos);
Client code:
List<Character> arr = new ArrayList<>();
arr.add('a');
arr.add('b');
arr.add('d');
arr.add('e');
reverseArray(arr, 0);
add a comment |
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
accepted
You are calling the overloaded version of remove that taken the element to be removed.
When you remove c, the third element gets removed. So, on the next recursive call, the last element (c) remains.
You need to remove the element by position
array.remove(array.size() - 1);
Perfect! I didn't catch that. Thanks very much.
– Benjamin Stark
Nov 10 at 4:55
add a comment |
up vote
1
down vote
accepted
You are calling the overloaded version of remove that taken the element to be removed.
When you remove c, the third element gets removed. So, on the next recursive call, the last element (c) remains.
You need to remove the element by position
array.remove(array.size() - 1);
Perfect! I didn't catch that. Thanks very much.
– Benjamin Stark
Nov 10 at 4:55
add a comment |
up vote
1
down vote
accepted
up vote
1
down vote
accepted
You are calling the overloaded version of remove that taken the element to be removed.
When you remove c, the third element gets removed. So, on the next recursive call, the last element (c) remains.
You need to remove the element by position
array.remove(array.size() - 1);
You are calling the overloaded version of remove that taken the element to be removed.
When you remove c, the third element gets removed. So, on the next recursive call, the last element (c) remains.
You need to remove the element by position
array.remove(array.size() - 1);
answered Nov 10 at 4:47
user7
8,73132038
8,73132038
Perfect! I didn't catch that. Thanks very much.
– Benjamin Stark
Nov 10 at 4:55
add a comment |
Perfect! I didn't catch that. Thanks very much.
– Benjamin Stark
Nov 10 at 4:55
Perfect! I didn't catch that. Thanks very much.
– Benjamin Stark
Nov 10 at 4:55
Perfect! I didn't catch that. Thanks very much.
– Benjamin Stark
Nov 10 at 4:55
add a comment |
up vote
0
down vote
I think you do it in wrong manner. You create too many useless temporary arrays. You just need just replace respective elements in ArrayList.
public static void reverseArray(List<Character> arr, int pos)
if (arr.isEmpty())
return;
int index = arr.size() - pos - 1;
if (pos >= index)
return;
char ch = arr.get(pos);
arr.set(pos, arr.get(index));
arr.set(index, ch);
reverseArray(arr, ++pos);
Client code:
List<Character> arr = new ArrayList<>();
arr.add('a');
arr.add('b');
arr.add('d');
arr.add('e');
reverseArray(arr, 0);
add a comment |
up vote
0
down vote
I think you do it in wrong manner. You create too many useless temporary arrays. You just need just replace respective elements in ArrayList.
public static void reverseArray(List<Character> arr, int pos)
if (arr.isEmpty())
return;
int index = arr.size() - pos - 1;
if (pos >= index)
return;
char ch = arr.get(pos);
arr.set(pos, arr.get(index));
arr.set(index, ch);
reverseArray(arr, ++pos);
Client code:
List<Character> arr = new ArrayList<>();
arr.add('a');
arr.add('b');
arr.add('d');
arr.add('e');
reverseArray(arr, 0);
add a comment |
up vote
0
down vote
up vote
0
down vote
I think you do it in wrong manner. You create too many useless temporary arrays. You just need just replace respective elements in ArrayList.
public static void reverseArray(List<Character> arr, int pos)
if (arr.isEmpty())
return;
int index = arr.size() - pos - 1;
if (pos >= index)
return;
char ch = arr.get(pos);
arr.set(pos, arr.get(index));
arr.set(index, ch);
reverseArray(arr, ++pos);
Client code:
List<Character> arr = new ArrayList<>();
arr.add('a');
arr.add('b');
arr.add('d');
arr.add('e');
reverseArray(arr, 0);
I think you do it in wrong manner. You create too many useless temporary arrays. You just need just replace respective elements in ArrayList.
public static void reverseArray(List<Character> arr, int pos)
if (arr.isEmpty())
return;
int index = arr.size() - pos - 1;
if (pos >= index)
return;
char ch = arr.get(pos);
arr.set(pos, arr.get(index));
arr.set(index, ch);
reverseArray(arr, ++pos);
Client code:
List<Character> arr = new ArrayList<>();
arr.add('a');
arr.add('b');
arr.add('d');
arr.add('e');
reverseArray(arr, 0);
answered Nov 10 at 4:50
oleg.cherednik
4,5932916
4,5932916
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53235991%2farraylist-item-index-is-incorrect-reversing-a-arraylist-with-recursion%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown