GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaPrograms/Leetcode_practice.java at main · ravipratap05/JavaPrograms Expand file tree/ Copy pathLeetcode_practice.javaMore file actions 40 lines (36 loc) · 1.25 KB / Copy pathLeetcode_practice.javaFile metadata and controls40 lines (36 loc) · 1.25 KB 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 import java.util.ArrayList; import java.util.Scanner; class Remove { void removeEle() { ArrayList<Integer> num = new ArrayList<>(); System.out.println("Enter the size of the array : "); try (Scanner sc = new Scanner(System.in)) { int n = sc.nextInt(); System.out.println("Enter elements one by one:"); for (int i = 0; i < n; i++) { int x = sc.nextInt(); num.add(x); } System.out.println("The entered array is : " + num); System.out.print("Enter element to be removed : "); int val = sc.nextInt(); for (int i = 0; i < n; i++) { if (val == num.get(i)) { num.remove(i); --i; // decrement index because a gap created after removal --n; // decrease count of remaining elements num.add(0); } } System.out.println("The entered array is : " + num); } } } public class Leetcode_practice { public static void main(String[] args) { // Testing the methods of the class. // removing element in the array Remove r = new Remove(); r.removeEle(); } } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |