3152. Special Array II
Difficulty: Medium
Topics: Array, Binary Search, Prefix Sum
An array is considered special if every pair of its adjacent elements contains two numbers with different parity.
You are given an array of integer nums and a 2D integer matrix queries, where for queries[i] = [fromi, toi] your task is to check that subarray1 nums[fromi..toi] is special or not.
Return an array of booleans answer such that answer[i] is true if nums[fromi..toi] is special.
Example 1:
- Input: nums = [3,4,1,2,6], queries = [[0,4]]
- Output: [false]
- Explanation: The subarray is [3,4,1,2,6]. 2 and 6 are both even.
Example 2:
- Input: nums = [4,3,1,6], queries = [[0,2],[2,3]]
- Output: [false,true]
- Explanation:
- The subarray is [4,3,1]. 3 and 1 are both odd. So the answer to this query is false.
- The subarray is [1,6]. There is only one pair: (1,6) and it contains numbers with different parity. So the answer to this query is true.
Constraints:
- 1 <= nums.length <= 105
- 1 <= nums[i] <= 105
- 1 <= queries.length <= 105
- queries[i].length == 2
- 0 <= queries[i][0] <= queries[i][1] <= nums.length - 1
Hint:
- Try to split the array into some non-intersected continuous special subarrays.
- For each query check that the first and the last elements of that query are in the same subarray or not.
Solution:
We need to determine whether a subarray of nums is "special," i.e., every pair of adjacent elements in the subarray must have different parity (one must be odd, and the other must be even).
Approach:
-
Identify Parity Transitions:
We can preprocess the array to mark positions where the parity changes. For example:
- 0 represents an even number.
- 1 represents an odd number.
The idea is to identify all positions where adjacent elements have different parity. This will help us efficiently determine if a subarray is special by checking if the positions in the query are part of the same "special" block.
-
Preprocessing:
Create a binary array parity_change where each element is 1 if the adjacent elements have different parity, otherwise 0. For example:- If nums[i] and nums[i 1] have different parity, set parity_change[i] = 1, otherwise 0.
Prefix Sum Array:
Construct a prefix sum array prefix_sum where each entry at index i represents the cumulative number of parity transitions up to that index. This helps quickly check if all pairs within a subarray have different parity.Query Processing:
For each query [from, to], check if there is any position in the range [from, to-1] where the parity doesn't change. This can be done by checking the difference in the prefix sum values: prefix_sum[to] - prefix_sum[from].
Let's implement this solution in PHP: 3152. Special Array II
<?php /** * @param Integer[] $nums * @param Integer[][] $queries * @return Boolean[] */ function specialArray($nums, $queries) { ... ... ... /** * go to ./solution.php */ } // Example usage $nums1 = [3,4,1,2,6]; $queries1 = [[0, 4]]; print_r(specialArray($nums1, $queries1)); // [false] $nums2 = [4,3,1,6]; $queries2 = [[0, 2], [2, 3]]; print_r(specialArray($nums2, $queries2)); // [false, true] ?> <h3> Explanation: </h3> <ol> <li><p><strong>Preprocessing Parity Transitions:</strong><br> We calculate parity_change[i] = 1 if the elements nums[i] and nums[i 1] have different parity. Otherwise, we set it to 0.</p></li> <li><p><strong>Prefix Sum Array:</strong><br> The prefix_sum[i] stores the cumulative count of parity transitions from the start of the array up to index i. This allows us to compute how many transitions occurred in any subarray [from, to] in constant time using the formula:<br> </p></li> </ol> <pre class="brush:php;toolbar:false"> $transition_count = $prefix_sum[$to] - $prefix_sum[$from];
- Query Evaluation: For each query, if the number of transitions is equal to the length of the subarray minus 1, the subarray is special, and we return true. Otherwise, we return false.
Time Complexity:
- Preprocessing the parity transitions takes O(n).
- Constructing the prefix sum array takes O(n).
- Each query can be answered in O(1) using the prefix sum array.
- Hence, the total time complexity is O(n q), where n is the length of the array and q is the number of queries.
This solution efficiently handles the problem constraints with an optimized approach.
Contact Links
If you found this series helpful, please consider giving the repository a star on GitHub or sharing the post on your favorite social networks ?. Your support would mean a lot to me!
If you want more helpful content like this, feel free to follow me:
- GitHub
-
Subarray A subarray is a contiguous sequence of elements within an array.??
The above is the detailed content of Special Array II. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undress AI Tool
Undress images for free

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Clothoff.io
AI clothes remover

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

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

To determine the strength of the password, it is necessary to combine regular and logical processing. The basic requirements include: 1. The length is no less than 8 digits; 2. At least containing lowercase letters, uppercase letters, and numbers; 3. Special character restrictions can be added; in terms of advanced aspects, continuous duplication of characters and incremental/decreasing sequences need to be avoided, which requires PHP function detection; at the same time, blacklists should be introduced to filter common weak passwords such as password and 123456; finally it is recommended to combine the zxcvbn library to improve the evaluation accuracy.

Common problems and solutions for PHP variable scope include: 1. The global variable cannot be accessed within the function, and it needs to be passed in using the global keyword or parameter; 2. The static variable is declared with static, and it is only initialized once and the value is maintained between multiple calls; 3. Hyperglobal variables such as $_GET and $_POST can be used directly in any scope, but you need to pay attention to safe filtering; 4. Anonymous functions need to introduce parent scope variables through the use keyword, and when modifying external variables, you need to pass a reference. Mastering these rules can help avoid errors and improve code stability.

To safely handle PHP file uploads, you need to verify the source and type, control the file name and path, set server restrictions, and process media files twice. 1. Verify the upload source to prevent CSRF through token and detect the real MIME type through finfo_file using whitelist control; 2. Rename the file to a random string and determine the extension to store it in a non-Web directory according to the detection type; 3. PHP configuration limits the upload size and temporary directory Nginx/Apache prohibits access to the upload directory; 4. The GD library resaves the pictures to clear potential malicious data.

There are three common methods for PHP comment code: 1. Use // or # to block one line of code, and it is recommended to use //; 2. Use /.../ to wrap code blocks with multiple lines, which cannot be nested but can be crossed; 3. Combination skills comments such as using /if(){}/ to control logic blocks, or to improve efficiency with editor shortcut keys, you should pay attention to closing symbols and avoid nesting when using them.

The key to writing PHP comments is to clarify the purpose and specifications. Comments should explain "why" rather than "what was done", avoiding redundancy or too simplicity. 1. Use a unified format, such as docblock (/*/) for class and method descriptions to improve readability and tool compatibility; 2. Emphasize the reasons behind the logic, such as why JS jumps need to be output manually; 3. Add an overview description before complex code, describe the process in steps, and help understand the overall idea; 4. Use TODO and FIXME rationally to mark to-do items and problems to facilitate subsequent tracking and collaboration. Good annotations can reduce communication costs and improve code maintenance efficiency.

AgeneratorinPHPisamemory-efficientwaytoiterateoverlargedatasetsbyyieldingvaluesoneatatimeinsteadofreturningthemallatonce.1.Generatorsusetheyieldkeywordtoproducevaluesondemand,reducingmemoryusage.2.Theyareusefulforhandlingbigloops,readinglargefiles,or

ToinstallPHPquickly,useXAMPPonWindowsorHomebrewonmacOS.1.OnWindows,downloadandinstallXAMPP,selectcomponents,startApache,andplacefilesinhtdocs.2.Alternatively,manuallyinstallPHPfromphp.netandsetupaserverlikeApache.3.OnmacOS,installHomebrew,thenrun'bre

TolearnPHPeffectively,startbysettingupalocalserverenvironmentusingtoolslikeXAMPPandacodeeditorlikeVSCode.1)InstallXAMPPforApache,MySQL,andPHP.2)Useacodeeditorforsyntaxsupport.3)TestyoursetupwithasimplePHPfile.Next,learnPHPbasicsincludingvariables,ech
