Arrayposneg.java

import java.util.*;


public class Arrayposneg {
    


   public static void main(String[] args) {
       Scanner sc = new Scanner(System.in);
       int n = sc.nextInt();
       int arr[] = new int[n];
       for (int i = 0; i < n; i++) {
           arr[i] = sc.nextInt();
       }
       partitionNegativeAndPositive(n, arr);
   }

   // Method to partition negative and positive numbers without comparing with 0
   static void partitionNegativeAndPositive(int n, int arr[]) {
       
    ArrayList<Integer> nums1 = new ArrayList<Integer>();
    ArrayList<Integer> nums2 = new ArrayList<Integer>();

    
    if(arr[0]>=0){
        for(int i = 0; i<n; i++){
            if(arr[i]>=0){
                nums1.add(arr[i]);
            }
        }
        for(int i = 0; i<n; i++){
            if(arr[i]<0){
                nums2.add(arr[i]);
            }
        }
        for (int number : nums1) {
                System.out.print(number+" ");
            }

            System.out.print("\n");

        for (int number : nums2) {
                System.out.print(number+" ");
            }
        if(nums2.size()==0){
                System.out.println("Array doesn't have negative numbers");
            }
    }else if(arr[0]<0){
        for(int i = 0; i<n; i++){
            if(arr[i]<0){
                nums2.add(arr[i]);
            }
        }
        for(int i = 0; i<n; i++){
            if(arr[i]>=0){
                nums1.add(arr[i]);
            }
        }
        for (int number : nums2) {
                System.out.print(number+" ");
            }

        System.out.print("\n");

        for (int number : nums1) {
                System.out.print(number+" ");
            }
        
    }
    if(nums1.size()==0){
                System.out.println("Array doesn't have positive numbers");
            }
   }


}