快手工程A卷前三题
靓号题,全过,菜鸡解法,JS写的,凑合看看😂
const checkAsc = (num) => { let result = 0; let anchor = 0; for (let i in num) { if (i > 0 && num[i - 1] !== num[i] - 1) { anchor = i; } result = Math.max(result, i - anchor + 1); } return result; }; // 检查升序顺子 const checkDesc = (num) => { let result = 0; let anchor = 0; for (let i in num) { if (i > 0 && num[i - 1] !== num[i] + 1) { anchor = i; } result = Math.max(result, i - anchor + 1); } return result; }; // 检查降序顺子 const checkShunzi = (num) => { return Math.max(checkAsc(num), checkDesc(num)); } const checkLeopard = (num) => { let result = 0; let anchor = 0; for (let i in num) { if (i > 0 && num[i - 1] !== num[i]) { anchor = i; } result = Math.max(result, i - anchor + 1); } return result + 0.5; } // 检查豹子 const input = readline().split(','); const result = []; for (let i in input) { const shunzi = checkShunzi(input[i].split('').map(item => parseInt(item)).slice(3)); const lepard = checkLeopard(input[i].split('').map(item => parseInt(item)).slice(3)); const weight = Math.max(shunzi, lepard); if (weight >= 3) { result.push([weight, input[i]]); } } result.sort((a, b) => a[0] - b[0] < 0); if (result.length === 0) { print(null); } else { print(result.map(item => item[1]).join(',')); }
const input = '2 1 22 22 33 25 55'.split(' ').map(item => parseInt(item)); const result = []; let max = input[0], smaller = 0; for (let i in input) { if (i == 0) { continue; } if (input[i] < max && input[i] >= smaller) { result.push(i); } else if (input[i] >= max) { [smaller, max] = [max, input[i]]; } } console.log(result.length === 0 ? -1 : result.join(' '));
第一题,全过,Python写的
height = [175, 173, 174, 163, 182, 177] temp = [height[0]] result = [] flag = False for item in height: flag = False for i in range(len(temp)): if temp[i] > item: flag = True result.append(i + 1) temp.insert(0, item) break if flag == False: result.append(0) temp.insert(0, item) print(result)