如何优化并修正反转句子单词顺序（非字母数字字符位置固定）的JavaScript代码？

Hey there! Let's tackle this problem step by step. Your goal is to reverse the order of alphanumeric words in a string while keeping non-alphanumeric characters in their original positions, and you've got a solid start but hit some edge cases and redundant loops. Let's fix that.

Issues in the Original Code #

First, let's call out the pain points in your current implementation:

• Edge case failures: When input is a single non-alphanumeric character (like "." or " "), text.match(/[a-z0-9]+/gi) returns null. Your check for null only logs the input but doesn't return early, so the rest of the code tries to run on null values and throws errors.
• Redundant loop logic: You’ve got four separate loop branches based on whether the string starts with alphanumeric characters and whether the lengths of alpha and nonAlpha arrays match. This makes the code verbose and hard to maintain.

Streamlined, Optimized Solution #

Here's a cleaner approach that resolves these issues and simplifies the logic:

function reverseAlphanumericWords(text) {
    // Extract all alphanumeric words, default to empty array if none exist to avoid null errors
    const alphanumericWords = text.match(/[a-z0-9]+/gi) || [];
    let wordPointer = alphanumericWords.length - 1; // Start with the last reversed word
    
    // Split the string into alternating non-alphanumeric and alphanumeric parts
    // The regex captures alphanumeric sequences, so they're included in the split result
    const stringParts = text.split(/([a-z0-9]+)/gi);
    
    // Reconstruct the final string by replacing alphanumeric parts with reversed words
    const result = stringParts.map(part => {
        if (/[a-z0-9]/i.test(part)) {
            return alphanumericWords[wordPointer--];
        }
        return part; // Keep non-alphanumeric parts unchanged
    });
    
    return result.join('');
}

// Test the function with various cases
console.log(reverseAlphanumericWords('Hello, it is world here.')); // Output: "here, world is it Hello."
console.log(reverseAlphanumericWords('.')); // Output: "."
console.log(reverseAlphanumericWords('   ')); // Output: "   "
console.log(reverseAlphanumericWords('Test123!@#Another456')); // Output: "Another456!@#Test123"
console.log(reverseAlphanumericWords('SingleWord')); // Output: "SingleWord"

How This Works #

1. Extract & Reverse Words: We use match to get all alphanumeric words, defaulting to an empty array if there are none (this avoids null-related errors). We then use a pointer to iterate backward through this reversed list of words.
2. Split String into Parts: Using split(/([a-z0-9]+)/gi) splits the original string into alternating non-alphanumeric and alphanumeric segments. The parentheses in the regex ensure that alphanumeric sequences are included in the split result.
3. Reconstruct the Result: We map over each segment: if it’s an alphanumeric word, we replace it with the next word from our reversed list (decrementing the pointer each time); otherwise, we leave the non-alphanumeric segment as-is.
4. Edge Case Handling: This approach naturally handles inputs with no alphanumeric words, single characters, and mixed-length sequences without extra conditional checks.

Key Improvements Over Original Code #

• Eliminates redundant loops and conditional branches, making the code shorter and easier to read.
• Gracefully handles all edge cases (single non-alphanumeric characters, empty strings, pure alphanumeric strings).
• Uses regex splitting to simplify segmenting the string, rather than manually tracking alphanumeric and non-alphanumeric arrays.

内容的提问来源于stack exchange，提问作者programmer24