In Previous Post Write a program to move all negative elements to end in an int array ? we learned how to move all negative elements to end in an Array. In this post, we will learn to write a program to move all zero at the end of the array with/without using existing data structures? Approach 1: Write… Read More »
In this post, we will learn How to write a program to move all negative elements to end in an int array with or without using existing data Structures in java? Approach 1 : without using existing Data Structures
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 |
package com.kkjavatutorials.client; /** * @author KK JavaTutorials * Write a program to move all negative elements to end in an int array * without using existing data structures */ public class MoveNegativeArrayElementsAtLast_1 { public static void main(String[] args) { //input Array int arr[] = {3, -3, 45, 2, -19, -7, 56, 45 }; int n = arr.length; moveAllNegativeElementsAtLastInArray(arr,n); //Printing array after moving all negative elements in last for (int i : arr) { System.out.print(i+" "); } } private static void moveAllNegativeElementsAtLastInArray(int[] arr, int n) { //Creating temporary array with same size as input array int tempAll[] = new int[n]; //Start index of tempAll[] array int j =0; //Storing positive or zero elements in tempAll[] array for (int i = 0; i < arr.length; i++) { if(arr[i]>=0) { tempAll[j++] = arr[i]; } } //If all numbers are either positive or zeros if(j == n || j == 0) return; //Storing negative elements in tempAll[] array for (int i = 0; i < arr.length; i++) { if(arr[i] < 0) { tempAll[j++] = arr[i]; } } //Copy all elements from tempAll[] to arr[] array for (int i = 0; i < tempAll.length; i++) { arr[i] = tempAll[i]; } } } |
Approach 2: with using existing Data Structures
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 |
package com.kkjavatutorials.client; import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * @author KK JavaTutorials * Write a program to move all negative elements to end in an int array * with using existing data structures */ public class MoveNegativeArrayElementsAtLast_2 { public static void main(String[] args) { //End of the program allNumbers will have final output List<Integer> allNumbers = new ArrayList<>(); //We will store all negative elements in this list List<Integer> negativeNumbers = new ArrayList<>(); //Input array int arr[] = {3, -3, 45, 2, -19, -7, 56, 45 }; for (Integer data : arr) { if(data >=0) { //Storing positive or zero elements allNumbers.add(data); }else { //Storing negative elements negativeNumbers.add(data); } } //Adding all negative elements in allNumbers list allNumbers.addAll(negativeNumbers); //Printing output for (int data : allNumbers) { System.out.print(data+" "); } } } |
Output of above program: 3 45 2… Read More »
Hello Friends, In this post we will talk and learn about one of the very important java programming interview question let’s say There is a stream of words which contains Anagrams. How would you print anagrams in a single bucket from that stream? Below Algorithm and data stricture we will use to implement same: 1) Use… Read More »
In this post, we will learn How to insert a node in Linked List at a given position in Java? Program Logic Explanation Case 1: If the insertion position is zero(o) then assign head to newNode.next and newNode to head. Case 2: If the insertion position >0 then We have to traverse the Linked list upto position-1 nodes. Once… Read More »
In This Post, We will learn How to find Nth node from the end of a Singly Linked List in Java? Complete Source code : Program Logic is Very Simple: We defined two Node references/Pointers(mainPointer & refPointer) and both will be initialized to the head node. First iterate refPointer to N nodes. Then iterate both node… Read More »
In this post, We will learn How to find the length of a Singly Linked List in Java? Program Logic: Initialize int length = 0, if List is Empty then return length. Traverse Linked List from head to last node(remember the last node always point to null) and increment length by 1 in every iteration finally… Read More »
In this post, We will learn How to search an element in a Singly Linked List in Java? Logic is Very Simple: If Linked List is Empty then search key will not be found so return false Traverse Linked List from head to last node(remember the last node always point to null) and compare Each node… Read More »
In this post, We will learn How to find the middle node in a Singly Linked List in Java? When We talk about finding the middle node of Linked List then we have the following two cases: NOTE: Here our intension is to find a middle element of LinkedList in Single pass. CASE 1: When Linked… Read More »
In the previous post, How to insert a node at the beginning of a Singly Linked List in Java, we learned, How to Insert a Node at the beginning of the Singly LinkedList. In this post, We will learn How to Insert a node at the end of a Singly Linked List in Java? Singly LinkedList… Read More »
In the previous post, Representation of Singly Linked List in Java,we learned How Custom Linked List represented internally. In this post, We will learn How to insert a node at the beginning of a Singly Linked List in Java? Singly LinkedList is a Data Structure used to store the collection of nodes and having the following properties:… Read More »