国产av日韩一区二区三区精品,成人性爱视频在线观看,国产,欧美,日韩,一区,www.成色av久久成人,2222eeee成人天堂

Table of Contents
For a better understanding, let's take a look at some input and output scenarios.
Stacks can be used. If you find the opening parentheses '
The algorithm is as follows:
Example
This approach uses two variables: count and length. If the character is "
Home Java javaTutorial Length of longest balanced parentheses prefix using Java

Length of longest balanced parentheses prefix using Java

Feb 07, 2025 am 11:55 AM
java

Length of longest balanced parentheses prefix using Java

This article explains how to use Java to find the length of the longest balanced parentheses prefix . First, we will understand the problem using several examples and then learn two different approaches to seek it.

Problem explanation

Here we give a string containing parentheses and we need to find the length of the balanced set of parentheses from the string. In other words, if there are all the opening parentheses

"("")", then we call it balanced. prefixes define a balanced set from the beginning of a string. For example, for the set of parentheses '(())()', only '(())' is considered.

Input and output scenarios

For a better understanding, let's take a look at some input and output scenarios.

If the input string is
    "(()"
  • , the balanced parentheses prefix is ??(), so the length is 2. If the input string is
  • "((()()))((("
  • , the balanced parentheses prefix is ??((()())))So the length is 8. If the input string is
  • "(()())()()"
  • , the balanced parentheses prefix is ??(()()), so The length is 6.
  • The length of the longest balanced parentheses prefix can be found as follows:

Using stack data structures
  • Count opening and closing parentheses
  • Using stack data structures

Stacks can be used. If you find the opening parentheses '

(

' from the stack, push it onto the stack. If you find a closing parentheses, pop the stack and increment the counter variable by 2 (the balance The length of the pair you got is 2.) Continue doing this and return a counter variable when it becomes an empty stack. Algorithm

The algorithm is as follows:

<code><p><b>ステップ1:</b>スタックとカウンタを初期化します。</p>
<p><b>ステップ2:</b>文字列の各文字を反復(fù)処理します。</p></code>
If the character is
    (
  • , push it onto the stack. If the character is
  • )
  • , pops the stack. Increments the counter by 2.
  • Check if the stack is empty.
  • If it is empty, ends the loop.
Step 3:

Return the counter at the end.

Example

<code><p><b>ステップ1:</b>スタックとカウンタを初期化します。</p>
<p><b>ステップ2:</b>文字列の各文字を反復(fù)処理します。</p></code>

Output

The input string is: ((())(( The length of the longest balanced parentheses prefix is: 6

Count opening and closing parentheses

This approach uses two variables: count and length. If the character is "

(

" from the string, increment count by 1; if the character is ")", decrement count by 1 and increment length by 2 . Check if count is 0, if it is 0, exit the loop and return length. Example

import java.util.Stack;

public class Example {
   public static int longestBalancedPrefix(String s) {
      Stack<Character> stack = new Stack<>();
      int count = 0;
      for (int i = 0; i < s.length(); i++) {
         char c = s.charAt(i);
         if (c == '(') {
            stack.push(c);
         } else if (c == ')') {
            if (!stack.isEmpty()) {
               stack.pop();
               count += 2;
            }
         }
         if (stack.isEmpty()) {
            break;
         }
      }
      return count;
   }

   public static void main(String[] args) {
      String s = "((())(((";
      int length = longestBalancedPrefix(s);
      System.out.println("入力文字列は:" + s);
      System.out.println("最長(zhǎng)のバランスの取れた括弧のプレフィックスの長(zhǎng)さは:" + length);
   }
}
Output

The input string is ((())())(())) The longest balanced parentheses prefix length is 8

The above is the detailed content of Length of longest balanced parentheses prefix using Java. For more information, please follow other related articles on the PHP Chinese website!

Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot AI Tools

Undress AI Tool

Undress AI Tool

Undress images for free

Undresser.AI Undress

Undresser.AI Undress

AI-powered app for creating realistic nude photos

AI Clothes Remover

AI Clothes Remover

Online AI tool for removing clothes from photos.

Clothoff.io

Clothoff.io

AI clothes remover

Video Face Swap

Video Face Swap

Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Tools

Notepad++7.3.1

Notepad++7.3.1

Easy-to-use and free code editor

SublimeText3 Chinese version

SublimeText3 Chinese version

Chinese version, very easy to use

Zend Studio 13.0.1

Zend Studio 13.0.1

Powerful PHP integrated development environment

Dreamweaver CS6

Dreamweaver CS6

Visual web development tools

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

What is a Singleton design pattern in Java? What is a Singleton design pattern in Java? Jul 09, 2025 am 01:32 AM

Singleton design pattern in Java ensures that a class has only one instance and provides a global access point through private constructors and static methods, which is suitable for controlling access to shared resources. Implementation methods include: 1. Lazy loading, that is, the instance is created only when the first request is requested, which is suitable for situations where resource consumption is high and not necessarily required; 2. Thread-safe processing, ensuring that only one instance is created in a multi-threaded environment through synchronization methods or double check locking, and reducing performance impact; 3. Hungry loading, which directly initializes the instance during class loading, is suitable for lightweight objects or scenarios that can be initialized in advance; 4. Enumeration implementation, using Java enumeration to naturally support serialization, thread safety and prevent reflective attacks, is a recommended concise and reliable method. Different implementation methods can be selected according to specific needs

How to analyze a Java heap dump? How to analyze a Java heap dump? Jul 09, 2025 am 01:25 AM

Analyzing Java heap dumps is a key means to troubleshoot memory problems, especially for identifying memory leaks and performance bottlenecks. 1. Use EclipseMAT or VisualVM to open the .hprof file. MAT provides Histogram and DominatorTree views to display the object distribution from different angles; 2. sort in Histogram by number of instances or space occupied to find classes with abnormally large or large size, such as byte[], char[] or business classes; 3. View the reference chain through "ListObjects>withincoming/outgoingreferences" to determine whether it is accidentally held; 4. Use "Pathto

What is a ThreadLocal in Java? What is a ThreadLocal in Java? Jul 09, 2025 am 02:25 AM

ThreadLocal is used in Java to create thread-private variables, each thread has an independent copy to avoid concurrency problems. It stores values ??through ThreadLocalMap inside the thread. Pay attention to timely cleaning when using it to prevent memory leakage. Common uses include user session management, database connections, transaction context, and log tracking. Best practices include: 1. Call remove() to clean up after use; 2. Avoid overuse; 3. InheritableThreadLocal is required for child thread inheritance; 4. Do not store large objects. The initial value can be set through initialValue() or withInitial(), and the initialization is delayed until the first get() call.

Java Optional example Java Optional example Jul 12, 2025 am 02:55 AM

Optional can clearly express intentions and reduce code noise for null judgments. 1. Optional.ofNullable is a common way to deal with null objects. For example, when taking values ??from maps, orElse can be used to provide default values, so that the logic is clearer and concise; 2. Use chain calls maps to achieve nested values ??to safely avoid NPE, and automatically terminate if any link is null and return the default value; 3. Filter can be used for conditional filtering, and subsequent operations will continue to be performed only if the conditions are met, otherwise it will jump directly to orElse, which is suitable for lightweight business judgment; 4. It is not recommended to overuse Optional, such as basic types or simple logic, which will increase complexity, and some scenarios will directly return to nu.

How to fix java.io.NotSerializableException? How to fix java.io.NotSerializableException? Jul 12, 2025 am 03:07 AM

The core workaround for encountering java.io.NotSerializableException is to ensure that all classes that need to be serialized implement the Serializable interface and check the serialization support of nested objects. 1. Add implementsSerializable to the main class; 2. Ensure that the corresponding classes of custom fields in the class also implement Serializable; 3. Use transient to mark fields that do not need to be serialized; 4. Check the non-serialized types in collections or nested objects; 5. Check which class does not implement the interface; 6. Consider replacement design for classes that cannot be modified, such as saving key data or using serializable intermediate structures; 7. Consider modifying

How to iterate over a Map in Java? How to iterate over a Map in Java? Jul 13, 2025 am 02:54 AM

There are three common methods to traverse Map in Java: 1. Use entrySet to obtain keys and values at the same time, which is suitable for most scenarios; 2. Use keySet or values to traverse keys or values respectively; 3. Use Java8's forEach to simplify the code structure. entrySet returns a Set set containing all key-value pairs, and each loop gets the Map.Entry object, suitable for frequent access to keys and values; if only keys or values are required, you can call keySet() or values() respectively, or you can get the value through map.get(key) when traversing the keys; Java 8 can use forEach((key,value)-&gt

How to implement a caching strategy in Java (e.g., using EhCache or Caffeine)? How to implement a caching strategy in Java (e.g., using EhCache or Caffeine)? Jul 09, 2025 am 01:17 AM

ToimproveperformanceinJavaapplications,choosebetweenEhCacheandCaffeinebasedonyourneeds.1.Forlightweight,modernin-memorycaching,useCaffeine—setitupbyaddingthedependency,configuringacachebeanwithsizeandexpiration,andinjectingitintoservices.2.Foradvance

Python web scraping dynamic content Python web scraping dynamic content Jul 10, 2025 pm 12:18 PM

Dynamic web crawling can be achieved through an analysis interface or a simulated browser. 1. Use browser developer tools to view XHR/Fetch requests in the Network, find the interface that returns JSON data, and use requests to get it; 2. If the page is rendered by the front-end framework and has no independent interface, you can start the browser with Selenium and wait for the elements to be loaded and extracted; 3. In the face of the anti-crawling mechanism, headers should be added, frequency control, proxy IP should be used, and verification codes or JS rendering detection should be carried out according to the situation. Mastering these methods can effectively deal with most dynamic web crawling scenarios.

See all articles