Facing the sun Java

PROGRAM TO FIND THE NUMBER OF BUILDINGS FACING THE SUN



class Test
{
    // Returns count buildings that can see sunlight
    static int countBuildings(int arr[], int n)
    {
        // Initialuze result  (Note that first building
        // always sees sunlight)
        int count = 1;
       
        // Start traversing element
        int curr_max = arr[0];
        for (int i=1; i<n; i++)
        {
            // If curr_element is maximum,
            // update maximum and increment count
            if (arr[i] > curr_max)
            {
                count++;
                curr_max=arr[i];
            }
        }
       
        return count;
    }
      
    // Driver method
    public static void main(String[] args) 
    {
        int arr[] = {7, 4, 8, 2, 9};
          
        System.out.println(countBuildings(arr, arr.length));
          
    }
}

OUTPUT
3

Comments

Post a Comment

Popular posts from this blog

Snake and Ladder Problem Python

PROGRAM TO SOLVE SNAKE AND LADDER PROBLEM class QueueEntry( object ):      def __init__( self , v = 0 , dist = 0 ):          self .v = v          self .dist = dist     '''This function returns minimum number of dice throws required to. Reach last cell  from 0'th cell in a snake and ladder game. move[] is an array of size N where N is  no. of cells on board. If there is no  snake or ladder from cell i, then move[i]  is -1. Otherwise move[i] contains cell to which snake or ladder at i takes to.''' def getMinDiceThrows(move, N):              # The graph has N vertices. Mark all      # the vertices as not visited      visited = [ False ] * N          # Create a queue for BFS      queue = []          # Mark the node 0 as visited and enqueue it      visited[ 0 ] = True          # Distance of 0't vertex is also 0      # Enqueue 0'th vertex      queue.append(QueueEntry( 0 , 0 ))          # Do a BFS starting from vertex at index 0      qe = QueueE
Read more

Add two numbers represented by linked lists Java

PROGRAM TO ADD TWO NUMBERS REPRESENTED BY LINKED LISTS class LinkedList {        static Node head1, head2;        static class Node {            int data;          Node next;            Node( int d)          {              data = d;              next = null ;          }      }        /* Adds contents of two linked lists and return the head node of resultant list */      Node addTwoLists(Node first, Node second)      {          // res is head node of the resultant list          Node res = null ;          Node prev = null ;          Node temp = null ;          int carry = 0 , sum;            // while both lists exist          while (first != null || second != null ) {              // Calculate value of next              // digit in resultant list.              // The next digit is sum              // of following things              // (i)  Carry              // (ii) Next digit of first              // list (if there is a next digit)              // (ii) Next digit of second    
Read more