ARRAY GFG 1

 package com.company;


import java.util.ArrayList;
import java.util.Arrays;

public class Array {
// Deleting an element and returning the size of that array
public static int deletion(int[] arr, int n, int element) {
int i;
for (i = 0; i < n; i++) {
if (arr[i] == element) {
break;
}
}
if (i == n) {
return n;
}

for (int j = i; j < n-1; j++) {
arr[j] = arr[j + 1];
}
return n-1;
}
// Deletion of an element in an array

public static int[] delete(int[] arr, int lastIndex, int index) {
if (lastIndex == index) {
arr[index] = 0;
return arr;
}
for (int i = index; i < lastIndex; i++) {
arr[i] = arr[i + 1];
arr[lastIndex] = 0;
}
return arr;
}

// Inserting an element at a position in an array without overwriting
public static int[] insert(int[] arr, int position, int n, int lastIndex) {

if (lastIndex == arr.length - 1) {
System.out.println("Array is full pagal!");
return arr;
}
int ind = position - 1;
for (int i = arr.length - 1; i >= ind; i--) {
arr[i] = arr[i - 1];
if (i == ind) {
arr[ind] = n;
}
}
return arr;
}
//Searching and element and returning the first index of that element

public static int searching(int[] arr, int n) {

for (int i = 0; i < arr.length; i++) {
if (arr[i] == n) {
return i;
}
}
return -1;
}

public static void main(String[] args) {
/*
// Creating an array list
ArrayList<Integer> numbers = new ArrayList<>();
numbers.add(89);
numbers.add(34);
numbers.add(22);
System.out.println(numbers);

// Searching
int[] arr = {1, 2, 5, 4, 5};
System.out.println(searching(arr, 58));

*/

// Inserting in an array
int[] ar = new int[7];
ar[0] = 5;
ar[1] = 10;
ar[2] = 260;
ar[3] = 10;
ar[4] = 206;
ar[5] = 520;
ar[6] = 620;
// ar[1] = 7;
System.out.println(deletion(ar, 7, 620));


}
}

Comments