通过按字母顺序删除字符来最小化清空给定字符串的成本

给定字符串str ，任务是最小化按字母顺序从字符串中删除所有字符的总成本。

The cost of removing any character at i ^th index from the string will be i. The indexing is 1-based.

例子：

Input: str = “abcab” 
Output: 8 
Explanation: 
First char ‘a’ at index 1 is removed, str[] becomes “bcab”, 
Then char ‘a’ with index 3 is removed, str[] becomes “bcb” 
After that char ‘b’ with index 1 is removed, str[] becomes “cb”, 
Then char ‘b’ with index 2 is removed, str[] becomes “c”, 
Finally, char ‘c’ is removed. 
Total points = 1+3 + 1 + 2 + 1 = 8. 

Input: str = “def” 
Output: 3

朴素的方法：最简单的方法是在每个步骤中删除字符串中索引较小的最小字符，并继续将成本添加到总成本中。打印此操作后的最终成本。

时间复杂度： O(N ² )
辅助空间： O(1)

有效的方法：可以通过对每个字符预先计算给定字符串它前面的较小字符的数量来优化上述方法。以下是步骤：

1. 将总成本初始化为0 。
2. 横向给定的字符串，并为每一个字符，数着小于当前字符和之前发生的字符数。
3. 如果此计数为 0，则表示将在当前索引处删除当前字符，因此将字符的索引添加到结果成本中。
4. 否则，从其当前索引中减去计数，然后将其添加到总成本中。
5. 完成上述所有步骤后打印总成本。

下面是上述方法的实现：

C++

// C++ program for the above approach
#include 
#include 
using namespace std;
 
// Function to find the minimum cost
// required to remove each character
// of the string in alphabetical order
int minSteps(string str, int N)
{
    int smaller, cost = 0;
 
    // Stores the frequency of
    // characters of the string
    int f[26] = { 0 };
 
    // Iterate through the string
    for (int i = 0; i < N; i++) {
        int curr_ele = str[i] - 'a';
        smaller = 0;
 
        // Count the number of characters
        // smaller than the present character
        for (int j = 0; j <= curr_ele; j++) {
            if (f[j])
                smaller += f[j];
        }
 
        // If no smaller character
        // preceeds current character
        if (smaller == 0)
            cost += (i + 1);
        else
            cost += (i - smaller + 1);
 
        // Increase the frequency of
        // the current character
        f[str[i] - 'a']++;
    }
 
    // Return the
    // total cost
    return cost;
}
 
// Driver Code
int main()
{
    // Given string str
    string str = "abcab";
    int N = str.size();
 
    // Function call
    cout << minSteps(str, N);
    return 0;
}

Java

// Java program for
// the above approach
import java.io.*;
class GFG{
 
    // Function to find the minimum cost
    // required to remove each character
    // of the string in alphabetical order
    static int minSteps(String str, int N)
    {
        int smaller, cost = 0;
 
        // Stores the frequency of
        // characters of the string
        int f[] = new int[26];
 
        // Iterate through the string
        for (int i = 0; i < N; i++)
        {
            int curr_ele = str.charAt(i) - 'a';
            smaller = 0;
 
            // Count the number of characters
            // smaller than the present character
            for (int j = 0; j <= curr_ele; j++)
            {
                if (f[j] != 0)
                    smaller += f[j];
            }
 
            // If no smaller character
            // preceeds current character
            if (smaller == 0)
                cost += (i + 1);
            else
                cost += (i - smaller + 1);
 
            // Increase the frequency of
            // the current character
            f[str.charAt(i) - 'a']++;
        }
 
        // Return the
        // total cost
        return cost;
    }
 
    // Driver Code
    public static void main(String[] args)
    {
        // Given string str
        String str = "abcab";
 
        int N = str.length();
 
        // Function call
        System.out.println(minSteps(str, N));
    }
}
 
// This code is contributed by AnkitRai01

Python3

# Python3 program for the above approach
 
# Function to find the minimum cost
# required to remove each character
# of the string in alphabetical order
def minSteps(str, N):
 
    cost = 0
 
    # Stores the frequency of
    # characters of the string
    f = [0] * 26
 
    # Iterate through the string
    for i in range(N):
        curr_ele = ord(str[i]) - ord('a')
        smaller = 0
 
        # Count the number of characters
        # smaller than the present character
        for j in range(curr_ele + 1):
            if (f[j]):
                smaller += f[j]
 
        # If no smaller character
        # preceeds current character
        if (smaller == 0):
            cost += (i + 1)
        else:
            cost += (i - smaller + 1)
 
        # Increase the frequency of
        # the current character
        f[ord(str[i]) - ord('a')] += 1
 
    # Return the total cost
    return cost
 
# Driver Code
 
# Given string str
str = "abcab"
 
N = len(str)
 
# Function call
print(minSteps(str, N))
 
# This code is contributed by Shivam Singh

C#

// C# program for
// the above approach
using System;
class GFG{
 
// Function to find the minimum cost
// required to remove each character
// of the string in alphabetical order
static int minSteps(string str, int N)
{
    int smaller, cost = 0;
 
    // Stores the frequency of
    // characters of the string
    int[] f = new int[26];
 
    // Iterate through the string
    for (int i = 0; i < N; i++)
    {
        int curr_ele = str[i] - 'a';
        smaller = 0;
 
        // Count the number of characters
        // smaller than the present character
        for (int j = 0; j <= curr_ele; j++)
        {
            if (f[j] != 0)
            smaller += f[j];
        }
         
        // If no smaller character
        // preceeds current character
        if (smaller == 0)
            cost += (i + 1);
        else
            cost += (i - smaller + 1);
 
        // Increase the frequency of
        // the current character
        f[str[i] - 'a']++;
    }
 
    // Return the
    // total cost
    return cost;
}
 
// Driver Code
public static void Main()
{
 
    // Given string str
    string str = "abcab";
 
    int N = str.Length;
 
    // Function call
    Console.Write(minSteps(str, N));
}
}
 
// This code is contributed by Chitranayal

Javascript

 
// JavaScript program for
// the above approach
 
// Function to find the minimum cost
// required to remove each character
// of the string in alphabetical order
function minSteps(str, N)
{
    var smaller,
    cost = 0;
     
    // Stores the frequency of
    // characters of the string
    var f = new Array(26).fill(0);
     
    // Iterate through the string
    for(var i = 0; i < N; i++)
    {
        var curr_ele = str[i].charCodeAt(0) -
                          "a".charCodeAt(0);
        smaller = 0;
         
        // Count the number of characters
        // smaller than the present character
        for(var j = 0; j <= curr_ele; j++)
        {
            if (f[j] !== 0)
                smaller += f[j];
        }
         
        // If no smaller character
        // preceeds current character
        if (smaller === 0)
            cost += i + 1;
        else
            cost += i - smaller + 1;
         
        // Increase the frequency of
        // the current character
        f[str[i].charCodeAt(0) -
             "a".charCodeAt(0)]++;
    }
     
    // Return the
    // total cost
    return cost;
}
 
// Driver Code
 
// Given string str
var str = "abcab";
var N = str.length;
 
// Function call
document.write(minSteps(str, N));
 
// This code is contributed by rdtank
 

输出：

8

时间复杂度： O(N)
辅助空间： O(26)

如果您想与行业专家一起参加直播课程，请参阅Geeks Classes Live