05 Stacks and Queues

题目 1：Nesting

A string S consisting of N characters is called properly nested if:

• S is empty;
• S has the form "(U)" where U is a properly nested string;
• S has the form "VW" where V and W are properly nested strings.

For example, string "(()(())())" is properly nested but string "())" isn't.

Write a function:

int solution(string &S);

that, given a string S consisting of N characters, returns 1 if string S is properly nested and 0 otherwise

For example, given S = "(()(())())", the function should return 1 and given S = "())", the function should return 0, as explained above.

Assume that:

• N is an integer within the range [0..1,000,000];
• string S consists only of the characters "(" and/or ")".

Complexity:

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

int solution(string &S) {
    // write your code in C++11
    int characters_sum=0;
    for(int i=0;S[i]!='\0';i++)
    {
        if(S[i]=='(')
            characters_sum++;
        else
        {
            characters_sum--;
            if(characters_sum<0)
              return 0;
        }
    }
    
    if(characters_sum!=0)
     return 0;
     else
     return 1;
}

题目 2 StoneWall

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:

int solution(vector<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).

 #include <algorithm>
 #include <stack>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &H) {
    // write your code in C++11
    long blocks=0;
    stack<int> sk;
    int n=H.size();
    for(int i=0;i<n;i++)
    {
        while(!sk.empty()&&sk.top()>H[i])
            sk.pop();
        if(sk.empty()||sk.top()<H[i])
        {
            sk.push(H[i]);
            blocks++;
        }
        if(!sk.empty()&&sk.top()==H[i])
            continue;
    }
    return blocks;
}

题目 3：brackets

A string S consisting of N characters is considered to be properly nested if any of the following conditions is true:

• S is empty;
• S has the form "(U)" or "[U]" or "{U}" where U is a properly nested string;
• S has the form "VW" where V and W are properly nested strings.

For example, the string "{[()()]}" is properly nested but "([)()]" is not.

Write a function:

int solution(string &S);

that, given a string S consisting of N characters, returns 1 if S is properly nested and 0 otherwise.

For example, given S = "{[()()]}", the function should return 1 and given S = "([)()]", the function should return 0, as explained above.

Assume that:

• N is an integer within the range [0..200,000];
• string S consists only of the following characters: "(", "{", "[", "]", "}" and/or ")".

Complexity:

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

// #include <algorithm>
   #include <stack>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
bool ismatch(char left,char right)
{
    if(left=='('&&right==')')
      return true;
    if(left=='['&&right==']')
      return true;
    if(left=='{'&&right=='}')
      return true;
    return false;
}

int solution(string &S) {
    // write your code in C++11
    stack<int> brackets;
    for(int i=0;S[i]!='\0';i++)
    {
        if((S[i]=='(')||(S[i]=='[')||(S[i]=='{'))
          brackets.push(S[i]);
        else
        {
            if(!brackets.empty())
            {
                if(ismatch(brackets.top(),S[i]))
                  brackets.pop();
                else
                   return 0;
            }
            else
              return 0;
        }
    }
    if(brackets.empty())
      return 1;
    else
      return 0;
}

题目 4：Fish

You are given two non-empty zero-indexed arrays A and B consisting of N integers. Arrays A and B represent N voracious fish in a river, ordered downstream along the flow of the river.

The fish are numbered from 0 to N − 1. If P and Q are two fish and P < Q, then fish P is initially upstream of fish Q. Initially, each fish has a unique position.

Fish number P is represented by A[P] and B[P]. Array A contains the sizes of the fish. All its elements are unique. Array B contains the directions of the fish. It contains only 0s and/or 1s, where:

• 0 represents a fish flowing upstream,
• 1 represents a fish flowing downstream.

If two fish move in opposite directions and there are no other (living) fish between them, they will eventually meet each other. Then only one fish can stay alive − the larger fish eats the smaller one. More precisely, we say that two fish P and Q meet each other when P < Q, B[P] = 1 and B[Q] = 0, and there are no living fish between them. After they meet:

• If A[P] > A[Q] then P eats Q, and P will still be flowing downstream,
• If A[Q] > A[P] then Q eats P, and Q will still be flowing upstream.

We assume that all the fish are flowing at the same speed. That is, fish moving in the same direction never meet. The goal is to calculate the number of fish that will stay alive.

For example, consider arrays A and B such that:

A[0] = 4 B[0] = 0 A[1] = 3 B[1] = 1 A[2] = 2 B[2] = 0 A[3] = 1 B[3] = 0 A[4] = 5 B[4] = 0

Initially all the fish are alive and all except fish number 1 are moving upstream. Fish number 1 meets fish number 2 and eats it, then it meets fish number 3 and eats it too. Finally, it meets fish number 4 and is eaten by it. The remaining two fish, number 0 and 4, never meet and therefore stay alive.

Write a function:

int solution(vector<int> &A, vector<int> &B);

that, given two non-empty zero-indexed arrays A and B consisting of N integers, returns the number of fish that will stay alive.

For example, given the arrays shown above, the function should return 2, as explained above.

Assume that:

• N is an integer within the range [1..100,000];
• each element of array A is an integer within the range [0..1,000,000,000];
• each element of array B is an integer that can have one of the following values: 0, 1;
• the elements of A are all distinct.

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).

// you can use includes, for example:
// #include <algorithm>
   #include <stack>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A, vector<int> &B) {
    // write your code in C++11
    int counteast=0;
    stack<int> west;
    int n=A.size();
    for(int i=0;i<n;i++)
    {
        if(B[i]==0)
        {
            while(!west.empty()&&west.top()<A[i])
                west.pop();
            if(!west.empty()&&west.top()>A[i])
               continue;
            if(west.empty())
               counteast++;
            
        }
        else
        {
            west.push(A[i]);
        }
    }
    return counteast+west.size();
}