Untitled

mail@pastecode.io avatarunknown
java
a month ago
1.5 kB
1
Indexable
Never
public class AMAZONOALinkedlist {
    public static class Segment{
        Segment next;
        int val;
        public Segment(int v){
            this.val = v;
        }
    }

    public static void main(String[] args) {
        Segment head = new Segment(-1);
        Segment curr = head;
        // int[] arr = {3,2,1,4,3,3,3,2,2,1,1,7,7,7,7,7,6,6,6,6,6,6,5};
        
        int[] arr = {2,5,4,4,5};
        for(int n : arr){
            curr.next = new Segment(n);
            curr = curr.next;
        }

        int ans = 1;
        Segment start = new Segment(-1);

        curr = head.next;
        while(curr != null){
            int count = 1;
            Segment s = curr;
            while(curr != null){
                System.out.print(curr.val + " ");
                if(curr.next != null && curr.next.val <= curr.val){
                    count++;
                    curr = curr.next;
                }else{
                    System.out.println("so far = " + count);
                    curr = curr.next;
                    break;
                }
            }

            if(count > ans){
                ans = count;
                start = s;
            }
        }

        System.out.println(" ANS " + ans);
        if(ans > 1 && start.val != -1){
            while(start != null && ans-- > 0){
                System.out.print(start.val + " -> ");
                start = start.next;
            }
        }
        
    }
}