Stock price (with.Java)

This is a story about the price of shares (with.Java).

I want to solve the coding test problem, find out how to solve it differently from the retrospective of the problem I solved, and get to know.

Let’s get to the problem first.

Problem

Complete the solution function so that when given as a parameter an array of prices containing stock prices recorded in seconds, the number of seconds the price has not dropped.

Restrictions

• Each price of the prices is a natural number of 1 or more and 10,000 or less.
• The length of the prices is not less than 2 but not more than 100,000.

Input/output Examples

problem solving

class Solution {
    public int[] solution(int[] prices) {
        int[] answer = new int[prices.length];
        for(int i = 0; i < prices.length - 1; i++){
            int init_0 = prices[i];
            int sec = 0;

            for(int j = i + 1; j < prices.length; j++){
                int init_1 = prices[j];
                sec++;

                if(init_0 > init_1){
                    break;
                }
            }

            answer[i] = sec;
        }
        return answer;
    }
}

Solution Description

This code solves the problem of receiving an array of stock prices and calculating how many seconds each stock price has not dropped.

First, create an array to store the time when the stock price has not fallen.

The length of this array is the same as the input array.

Check the price of each stock through the first iteration.

The last stock price does not need to be compared, so repeat by subtracting one from the length of the stock array.

It stores the current stock price in a variable and initializes the variable to store the time when the stock price has not fallen.

Check the stock prices after the current stock price through the second iteration.

Store the stock price to compare in a variable and increase the time by one second because the stock price has not fallen.

If the current stock price is greater than the stock price to be compared, the stock price has fallen, so we end the iteration.

Saves the time when the current stock price has not fallen into the array.

This process calculates the amount of time that has not fallen for all stock prices, and then returns the array of results.

For example, if the stock price arrangement is 1, 2, 3, 2, 3, the first price 1 is 4 seconds without dropping, the second price 2 is 3 seconds, the third price 3 is 1 second, the fourth price 2 is 1 second, and the last price 3 is 0 seconds because there is no need to compare.

So the resulting array is 4, 3, 1, 1, 0.

This code solves the problem of efficiently calculating the time when stock prices have not fallen and returning them in array form.