给定一个字符串str和一个字符串数组strArr[] ,任务是根据str定义的字母顺序对数组进行排序。
注意: str和strArr[] 中的每个字符串仅由小写字母组成。
例子:
Input: str = “fguecbdavwyxzhijklmnopqrst”,
strArr[] = {“geeksforgeeks”, “is”, “the”, “best”, “place”, “for”, “learning”}
Output: for geeksforgeeks best is learning place the
Input: str = “avdfghiwyxzjkecbmnopqrstul”,
strArr[] = {“rainbow”, “consists”, “of”, “colours”}
Output: consists colours of rainbow
方法:遍历str的每一个字符,将值存入map,以字符为键,在数组中的索引为值。
现在,此映射将作为字符的新字母顺序。开始字符串中的strArr []进行比较,并代替compairing字符的ASCII值,在地图比较映射到这些特定的字符的值即,如果在STR那么c1
下面是上述方法的实现:
C++
// C++ implementation of the approach
#include
using namespace std;
// Map to store the characters with their order
// in the new alphabetical order
unordered_map h;
// Function that returns true if x < y
// according to the new alphabetical order
bool compare(string x, string y)
{
for (int i = 0; i < min(x.size(), y.size()); i++) {
if (h[x[i]] == h[y[i]])
continue;
return h[x[i]] < h[y[i]];
}
return x.size() < y.size();
}
// Driver code
int main()
{
string str = "fguecbdavwyxzhijklmnopqrst";
vector v{ "geeksforgeeks", "is", "the",
"best", "place", "for", "learning" };
// Store the order for each character
// in the new alphabetical sequence
h.clear();
for (int i = 0; i < str.size(); i++)
h[str[i]] = i;
sort(v.begin(), v.end(), compare);
// Print the strings after sorting
for (auto x : v)
cout << x << " ";
return 0;
}
Java
// Java implementation of the approach
import java.util.Arrays;
import java.util.Comparator;
public class GFG
{
private static void sort(String[] strArr, String str)
{
Comparator myComp = new Comparator()
{
@Override
public int compare(String a, String b)
{
for(int i = 0;
i < Math.min(a.length(),
b.length()); i++)
{
if (str.indexOf(a.charAt(i)) ==
str.indexOf(b.charAt(i)))
{
continue;
}
else if(str.indexOf(a.charAt(i)) >
str.indexOf(b.charAt(i)))
{
return 1;
}
else
{
return -1;
}
}
return 0;
}
};
Arrays.sort(strArr, myComp);
}
// Driver Code
public static void main(String[] args)
{
String str = "fguecbdavwyxzhijklmnopqrst";
String[] strArr = {"geeksforgeeks", "is", "the", "best",
"place", "for", "learning"};
sort(strArr, str);
for(int i = 0; i < strArr.length; i++)
{
System.out.print(strArr[i] + " ");
}
}
}
Python3
# Python3 implementation of the approach
# Function to sort and print the array
# according to the new alphabetical order
def sortStringArray(s, a, n):
# Sort the array according to the new alphabetical order
a = sorted(a, key = lambda word: [s.index(c) for c in word])
for i in a:
print(i, end =' ')
# Driver code
s = "fguecbdavwyxzhijklmnopqrst"
a = ["geeksforgeeks", "is", "the", "best", "place", "for", "learning"]
n = len(a)
sortStringArray(s, a, n)
for geeksforgeeks best is learning place the
时间复杂度: O(N * log(N)),其中 N 是字符串str的大小
辅助空间: O(N)
如果您希望与专家一起参加现场课程,请参阅DSA 现场工作专业课程和学生竞争性编程现场课程。