Given an integer list nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the array.
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Please help with the following in JAVA:
Question 1
Could you minimize the total number of operations done for the previous problem?
Previous Question > Given an integer list nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the array.
Code
public static void main(String[] args) {
ArrayList<Integer> mylist = new ArrayList<Integer>();
Scanner sc = new Scanner(System.in);
System.out.println("Enter the list with last a add : ");
while (sc.hasNextInt()) {//TAKING INPUT UNTILL THE USER ENTERS ANY CHARACTER OTHER THAN INT
int i = sc.nextInt();
mylist.add(i);
}
int count=0;
for(int i=0;i<mylist.size();i++)
{
if(mylist.get(i)==0)
{
count++; //COUNTING NUMBER OF ZEROES
}
}
while(count!=0)
{
for(int i=0;i<mylist.size()-1;i++)
{
if(mylist.get(i)==0)
{
Collections.swap(mylist, i, i+1);
}
}
count--;
}
for(int i=0;i<mylist.size();i++)
{
System.out.print(mylist.get(i)+ " "); //PRINTING THE FINAL IN-PLACE LIST
}
}
Step by step
Solved in 2 steps with 2 images
