(LeetCode) Custom Sort String - LeetCode

本文介绍了一种基于定制顺序的字符串排序算法,通过两个辅助函数实现字符移除和字符串排序,确保了输入字符串T中字符的排列顺序符合预设字符串S的顺序。适用于字符串长度不超过特定限制的情况。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Description:

S and T are strings composed of lowercase letters. In S, no letter occurs more than once.

S was sorted in some custom order previously. We want to permute the characters of T so that they match the order that S was sorted. More specifically, if x occurs before y in S, then x should occur before y in the returned string.

Return any permutation of T (as a string) that satisfies this property.

Example :
Input: 
S = "cba"
T = "abcd"
Output: "cbad"
Explanation: 
"a", "b", "c" appear in S, so the order of "a", "b", "c" should be "c", "b", and "a". 
Since "d" does not appear in S, it can be at any position in T. "dcba", "cdba", "cbda" are also valid outputs.

 

Note:

  • S has length at most 26, and no character is repeated in S.
  • T has length at most 200.
  • S and T consist of lowercase letters only.
Accepted
40K
Submissions
63.5K

Solution:

There are two helper functions I used. 

1.  String charRemoveAt(String str, int p) ;

with the help of this function, I can delete character at position p in the given String str. 

2. Sort a String 

 

Method 1(natural sorting) :

 

  1. Apply toCharArray() method on input string to create a char array for input string.
  2. Use Arrays.sort(char c[]) method to sort char array.
  3. Use String class constructor to create a sorted string from char array.

 

class Solution {
    public String customSortString(String S, String T) {
        
        if(S==null||S.length()==0||T==null||T.length()==0){
            return null;
        }
        
        
        String res = "";
        
        for(int i = 0; i<S.length(); i++){
            
           // System.out.println(S.charAt(i));
           while (T.indexOf(S.charAt(i))>=0){
                
                res = res + Character.toString((S.charAt(i)));
                                               
                T = charRemoveAt(T,T.indexOf(S.charAt(i)));
            }
        }
        
         char tempArray[] = T.toCharArray();
         Arrays.sort(tempArray); 
         T = new String(tempArray);
        
         //System.out.println(charRemoveAt(T,T.indexOf('e')));
        return res + T;
        
        
    }
    
      public static String charRemoveAt(String str, int p) {  
              return str.substring(0, p) + str.substring(p + 1);  
           }  
}

 

转载于:https://www.cnblogs.com/codingyangmao/p/11451219.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值