欧美1区2区3区激情无套,两个女人互添下身视频在线观看,久久av无码精品人妻系列,久久精品噜噜噜成人,末发育娇小性色xxxx

首頁 > 試題廣場 >

程序設(shè)計（可用任何編程語言實現(xiàn)） 排序數(shù)字字符串的數(shù)字（升

[問答題]
程序設(shè)計（可用任何編程語言實現(xiàn)）
排序數(shù)字字符串的數(shù)字（升序），遇到0時從數(shù)字字符串中刪除，如"1324”排序后應(yīng)該為“1234”，”9002“排序后應(yīng)該為”29“。 
class?Solution:
????def?sort_number_str(self,?s):
????????if?not?s:
????????????return?s
????????s_lst?=?list(map(int,?list(s)))
????????self.quit_sort(s_lst,?0,?len(s_lst)?-?1)
????????return?''.join([str(i)?for?i?in?s_lst?if?i?>?0])

????def?quit_sort(self,?lst,?left,?right):
????????def?find_index(lst,?left,?right):
????????????tmp?=?lst[left]
????????????while?left?<?right:
????????????????while?left?<?right?and?lst[right]?>=?tmp:
????????????????????right?-=?1
????????????????lst[left]?=?lst[right]
????????????????while?left?<?right?and?lst[left]?<=?tmp:
????????????????????left?+=?1
????????????????lst[right]?=?lst[left]
????????????lst[left]?=?tmp
????????????return?left

????????if?left?<?right:
????????????index?=?find_index(lst,?left,?right)
????????????self.quit_sort(lst,?left,?index?-?1)
????????????self.quit_sort(lst,?index?+?1,?right)

發(fā)表于 2019-10-28 00:49:00 回復(fù)(0)
java 語言: 
@Test
	public void test8(){
		String a = "1207653";
		char[] charArray = a.replaceAll("0", "").toCharArray();
		Arrays.sort(charArray);
		System.out.println(new String(charArray));
	}

發(fā)表于 2016-04-12 21:37:48 回復(fù)(0)
var num="9002";
function stringchange(num){
? ?var pattern=/[0]*/g;
? ?num=num.replace(pattern,"");
? ?num=num.split("");
? ?num.sort(function(a,b){
? ? ? ? return a-b;
? ?});
? ?console.log(num.join(""));
} 

stringchange(num);

發(fā)表于 2015-09-01 15:41:40 回復(fù)(0)
XD頭像 XD 
//采用優(yōu)先隊列 重載為升序排列
typedef priority_queue<char,vector<char >,greater<char> > pq;
pq slove()
{
    string str = "900142";
    priority_queue<char,vector<char >,greater<char> > que;
    int len = str.size();
    //不將字符0 插入隊列
    for(int i = 0;i < len;i++)
    {
        if(str[i] >= '1' && str[i] <= '9')
        {
            que.push(str[i]);
        }
    }
    //測試輸出
    while(!que.empty())
    {
        cout << que.top() << endl;
        que.pop();
    }
    return que;
}


發(fā)表于 2015-08-19 10:50:27 回復(fù)(0)
void strSort(char *str){
if (NULL == str) return;
int map[9];
int n = strlen(str);
for (int i = 0; i < 9; ++i){
map[i] = 0;
}
for (int i = 0; i < n; ++i){
if (str[i] >= '1' && str[i] <= '9') ++map[str[i] - '1'];
}
int j = 0;
for (int i = 0; i < 9; ++i){
while (map[i] > 0){
str[j++] = i + '1';
--map[i];
}
}
str[j] = '\0';
}
發(fā)表于 2015-08-19 10:13:41 回復(fù)(0)
function sortFn(str){
return str.replace(/0/g,"").split("").sort().join("");
}

發(fā)表于 2015-08-19 09:13:34 回復(fù)(0) 
def remove_string_0(str):
    return ''.join(sorted([i for i in str if i != '0']))

發(fā)表于 2015-08-19 01:25:28 回復(fù)(0) 
 def removeString0(str_str):
    tempStr=[]
    print(str_str)
    for i in range(len(str_str)):
        tempStr.append(int(str_str[i]))
    tempStr=sorted(tempStr)
    Str=[]
    for index in range(len(tempStr)):
        if tempStr[index]!=0:
            Str.append(tempStr[index])
    print(Str)
編輯于 2015-08-18 20:06:07 回復(fù)(0)