zoukankan      html  css  js  c++  java
  • Codility---StoneWall

    Task description

    You are going to build a stone wall. The wall should be straight and N meters long, and its thickness should be constant; however, it should have different heights in different places. The height of the wall is specified by a zero-indexed array H of N positive integers. H[I] is the height of the wall from I to I+1 meters to the right of its left end. In particular, H[0] is the height of the wall's left end and H[N−1] is the height of the wall's right end.

    The wall should be built of cuboid stone blocks (that is, all sides of such blocks are rectangular). Your task is to compute the minimum number of blocks needed to build the wall.

    Write a function:

    class Solution { public int solution(int[] H); }

    that, given a zero-indexed array H of N positive integers specifying the height of the wall, returns the minimum number of blocks needed to build it.

    For example, given array H containing N = 9 integers:

    H[0] = 8 H[1] = 8 H[2] = 5 H[3] = 7 H[4] = 9 H[5] = 8 H[6] = 7 H[7] = 4 H[8] = 8

    the function should return 7. The figure shows one possible arrangement of seven blocks.

    Assume that:

    • N is an integer within the range [1..100,000];
    • each element of array H is an integer within the range [1..1,000,000,000].

    Complexity:

    • expected worst-case time complexity is O(N);
    • expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments).

    Elements of input arrays can be modified.

    Solution
     
    Programming language used: Java
    Total time used: 33 minutes
    Effective time used: 33 minutes
    Code: 16:12:13 UTC, java, final, score:  100
    // you can also use imports, for example:
    // import java.util.*;
    
    // you can write to stdout for debugging purposes, e.g.
    // System.out.println("this is a debug message");
    import java.util.Stack;
    class Solution {
        public int solution(int[] H) {
            // write your code in Java SE 8
            int blockct = 0;
            Stack<Integer> st = new Stack();
            int wallHeight = 0;
            for(int i=0;i<H.length;i++) {
                int currHeight = H[i];
                while(wallHeight > currHeight) {
                    wallHeight -= st.peek();
                    st.pop();
                }
                if(wallHeight < currHeight) {
                    st.push(currHeight - wallHeight);
                    wallHeight = currHeight;
                    blockct++;
                }
            }
            return blockct;
        }
    }


    https://codility.com/demo/results/trainingZ6BBNM-68A/
  • 相关阅读:
    jquery选择器
    js实现添加className
    日期函数(date)
    IE6和IE7中<a>标签宽高设置无效的问题
    Uva 548 二叉树的递归遍历lrj 白书p155
    Uva 122 树的层次遍历 Trees on the level lrj白书 p149
    Uva 679 Dropping Ballls 二叉树的编号
    Uva 12657 Boxes in a Line 双向链表
    Uva 11988 Broken Keyboard STL+链表
    埃及分数问题+迭代加深搜索
  • 原文地址:https://www.cnblogs.com/samo/p/6864484.html
Copyright © 2011-2022 走看看