美团前端笔试编程题解析

var n = read_line() - 0
while (n--) {
	var str = read_line()
	if (!/^[a-zA-Z0-9]+$/.test(str)) {
		print('NO')
	} else if (str.length < 8) {
		print('NO')
	} else if (/^[\d]$/.test(str[0])) {
		print('NO')
	} else {
		var countA = 0,
			counta = 0,
			count0 = 0
		for (var i = 0; i < str.length; i++) {
			if (str[i] >= 'A' && str[i] <= 'Z') countA++;
			if (str[i] >= 'a' && str[i] <= 'z') counta++;
			if (str[i] >= 0 && str[i] <= 9) count0++;
		}
		var count = 0;
		if (countA > 0) count++;
		if (counta > 0) count++;
		if (count0 > 0) count++;
		if (count >= 2) print('YES')
		else print('NO')
	}
}

var n = read_line() - 0
var str = read_line().split(' ').map(function(item) {
	return item - 0
})
var arr = [] //保存降序排列的数字
for (var i = 0; i < n - 1; i++) {
	if (str[i + 1] < str[i]) { //降序
		arr.push({
			k: i + 1, //下标
			v: str[i + 1] //值
		})
	}
}
arr.sort(function(a, b) { //升序排列
	return a.v - b.v
})
if (arr.length == 0) { //长度为0，说明那n个数是一直升序的，那么就不需要交换，直接输出就好了
	print(str.join(' '))
} else {
	var minKey = arr[0].k
	var minValue = arr[0].v //这个就是上面说到的最小的X了

	var i = minKey - 1
	while (str[i] > minValue) {
		i-- //往前找
	}
	var temp = str[i + 1] //这个数就是上面说到的Z了
	str[i + 1] = minValue
	str[minKey] = temp
	print(str.join(' '))
}