523066680

回复 19# happy886rr


    ? 贴了一个别人的，好像是快速排序

happy886rr

回复 11# 523066680
是否可以用快速排序

523066680

回复 17# GNU


      他们当然知道如何获取更详细的时间单位，说的是那个网站的在线测试的时间单位精度有限。
再说线下比较还可以增加测试次数和列表数据量。所以不同的结论需要结合前后文(Context)。

GNU

回复 16# CrLf


PowerShell的 Measure-Command 可以获取到 Ticks
1 Ticks = 100 纳秒 = 1/10000 毫秒

CrLf

好像还可以继续优化，可惜没有微秒和纳秒，比较不出来

CrLf

回复 13# xxpinqz


    说实话，不是很喜欢谍影重重5这种全程高能的肌肉片

523066680

#define _CRT_SECURE_NO_WARNINGS

#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>

int Comparer(char * strLeft, char * strRight)
{
	char * cmpLeft = strLeft;
	char * cmpRight = strRight;
	for (;; ++cmpLeft, ++cmpRight)
	{
		char chLeft = *cmpLeft;
		char chRight = *cmpRight;

		if (!chLeft && !chRight)
			return 0;

		if (!chLeft)
		{
			cmpLeft = strRight;
			chLeft = *cmpLeft;
		}

		if (!chRight)
		{
			cmpRight = strLeft;
			chRight = *cmpRight;
		}

		if (chLeft == chRight)
			continue;
		else
			return chLeft > chRight;
	}
	return 0;
}

void QS_Swap(char ** left, char ** right)
{
	char * tmp = *left;
	*left = *right;
	*right = tmp;
}

int QS_Partition(char ** arr, int lo, int hi)
{
	char * pivot = arr[hi];
	int i = lo;

	for (int j = lo; j < hi; ++j)
	{
		if (Comparer(arr[j], pivot))
		{
			QS_Swap(&arr[i], &arr[j]);
			++i;
		}
	}
	QS_Swap(&arr[i], &arr[hi]);
	return i;
}

void QS_Sort(char ** arr, int lo, int hi)
{
	if (lo < hi)
	{
		int p = QS_Partition(arr, lo, hi);
		QS_Sort(arr, lo, p - 1);
		QS_Sort(arr, p + 1, hi);
	}
}

void QSort(char ** arr, int len)
{
	QS_Sort(arr, 0, len - 1);
}

char * largestNumber(int * nums, int numsSize)
{
	char * strBuf = (char*)malloc(numsSize * 16);
	char ** strNums = (char**)malloc(sizeof(char*) * numsSize);
	int szTotalLen = 0;
	for (int i = 0; i < numsSize; ++i)
	{
		//char * strItem = _itoa(pNums[i], strBuf, 10);
		sprintf(strBuf, "%d", nums[i]);
		char * strItem = strBuf;

		int slen = strlen(strItem);
		szTotalLen += slen;

		strBuf += slen + 1;
		strNums[i] = strItem;
	}

	QSort(strNums, numsSize);

	strBuf = (char*)malloc(szTotalLen + 1);
	char * strRes = strBuf;
	for (int i = 0; i < numsSize; ++i)
	{
		char * strItem = strNums[i];
		strcpy(strBuf, strItem);
		strBuf += strlen(strItem);
	}

	while (*strRes == '0' && *(strRes + 1))
		++strRes;

	return strRes;
}

int main()
{
	int nums[] = { 0, 0, 1 };
	char *s = largestNumber(nums, sizeof(nums) / sizeof(nums[0]));
	printf("%s", s);

	return 0;
}
复制代码

xxpinqz

回复 8# CrLf

听说谍影系列不适合看3d版。。。晃不
没影院放2d的。

xxpinqz

回复 9# 523066680

嗯，不截取就好，我干嘛去截取。谢谢！

523066680

大家都习惯花括号不换行吗……

CrLf

JavaScript 124ms：

var largestNumber = function(nums) {
    var arr = [];
    [].forEach.call(arguments,function(a){a.map?[].push.apply(arr,a):arr.push(a)})
	return arr
    	.sort(function(a,b){
    		return ''+b+a > ''+a+b ? 1 : -1
    	})
    	.join('').replace(/^0+(.)/,'$1')
}
复制代码

C语言 0ms：

char* largestNumber(int* nums, int numsSize) {
	struct struct_num{
		int digit;
		int number;
	};

	struct struct_num *group[10][100], *pg, *pg2;
	int group_count[10]={0,0,0,0,0,0,0,0,0,0};
	int i,j,k;
	int number,index,digit;
	char output[10000]="0";
	char *p=output;

	const char itoa_map[11]="0123456789";

	for(i=numsSize;i--;){
		number = nums[i];

		for(digit=10;number>=digit;digit*=10){}
		index = number/(digit/10);

		pg=(struct struct_num *)malloc(sizeof(struct struct_num));

		group[index][group_count[index]++]=pg;
		(pg)->number = number;
		(pg)->digit = digit;
	}

	for(i=10;i--;){
		for(j=group_count[i];j-->0;){
			pg = group[i][j];

			for(k=j;k-->0;){
				pg2 = group[i][k];
				if(
					((long long) pg->number * pg2->digit+pg2->number)< ((long long) pg2->number * pg->digit + pg->number)
				){
					* (long long*) pg ^= * (long long*) pg2;
					* (long long*) pg2 ^= * (long long*) pg;
					* (long long*) pg ^= * (long long*) pg2;
				}
			}
		}
		for(j=group_count[i];j--;){
			pg = group[i][j];
			number = pg->number;
			digit = pg->digit / 10;
			while(digit >= 1){
				*p++ = itoa_map[number / digit % 10];
				digit /= 10;
			}
			free(pg);
		}
	}
	if(output[0]=='0')return "0";

	*p='\0';

	return output;
}
复制代码

523066680

回复 7# xxpinqz


    当输入数字是 830 8308 时，显示结果为：8308

CrLf

回复 2# 523066680


    看完夜场谍影重重，回家撸了C语言

221 / 221 test cases passed.
Status: Accepted
Runtime: 0 ms

还不下跪

xxpinqz

@echo off&setlocal enabledelayedexpansion
set "s=89 89891 830 8308 8300 89899 9 999999999999999999999 9999999999999999999999999999"
for %%a in (%s%) do (
    set "a=%%a%%a%%a%%a%%a%%a%%a%%a%%a!random!"
    set #!a!=%%a
)
(for /f "tokens=2 delims==" %%a in ('set # ^|sort /r') do set/p.=%%a)<nul
pause
复制代码

变量a受最长的数值影响。。。。。。

pcl_test

#*&cls&gawk -f "%~f0"&pause&exit

BEGIN{
    str="3,30,34,5,9"
    split(str,a,",");
    if(length(a)==1){
        print a[1];
    }else{
        if(str~/^[0,]*$/){
            print 0;
        }else{
            for(i=1;i<=length(a);i++){
                if(a[i]~/^0+[1-9][0-9]*$/){
                    sub(/^0+/,"",a[i]);
                }else{
                    if(a[i]~/^0+$/)sub(/0+/,"0",a[i]);
                }
                t=a[i];
                j=i-1;
                while(j>=1&&(!comp(a[j],t))){
                    a[j+1]=a[j];
                    j--;
                }
                a[j+1]=t;
            }
            for(i=1;i<=length(a);i++)s=s""a[i];
            print s;
        }
    }
}
function comp(a,b){return (a""b)*1>(b""a)*1?1:0;}
复制代码