codewars练习（javascript）-2021/4/7

codewars-js练习

2021/4/7

github 地址

my github地址，上面有做的习题记录，不断更新…

【1】<7kyu>【Max sum between two negatives】

任务是返回位于两个负元素之间的元素的最大和，或者返回-1，如果没有这样的和，则返回类似的空值。这个和中不应该有负号。

example：

[4, -1, 6, -2, 3, 5, -7, 7] -> 8
     ^      ^         ^

solution

<script type="text/javascript">
	function maxSumBetweenTwoNegatives(arr) {
		console.log(arr)
		let [highest, sum, negatives] = [0, 0, 0];
		for (var i = 0; i < arr.length; i++) {
			if (arr[i] < 0) {
		  		if (sum > highest) highest = sum;
		  		negatives++;
		  		sum = 0;
			}else if (negatives > 0) {
		  		sum += arr[i];
			}
		}
		return negatives > 1 ? highest : -1;

	}

    // 验证
  	console.log(maxSumBetweenTwoNegatives([-1,6,-2,3,5,-7]));//8
	// console.log(maxSumBetweenTwoNegatives([5,-1,-2]));// 0 
	// console.log(maxSumBetweenTwoNegatives([1,-2]));//-1 
</script>

【2】<5kyu>【Factorial decomposition】

目的是分解n!(n的阶乘)变成它的质因数。

质数应该是递增的。当a '的指数是1时，不要把指数写出来。

example：

n = 12; decomp(12) -> "2^10 * 3^5 * 5^2 * 7 * 11"
since 12! is divisible by 2 ten times, by 3 five times, by 5 two times and by 7 and 11 only once.

n = 22; decomp(22) -> "2^19 * 3^9 * 5^4 * 7^3 * 11^2 * 13 * 17 * 19"

n = 25; decomp(25) -> 2^22 * 3^10 * 5^6 * 7^3 * 11^2 * 13 * 17 * 19 * 23

solution

<script type="text/javascript">
	function decomp(n) {
		let coll = {};

		for (let i=2; i<=n; i++) coll[i] = 1;

		for (let i=n; i>1; i--) {
			for (let k=2; k<=Math.sqrt(i); k++) {
			  if (i%k === 0) {
			    coll[k] += coll[i];
			    coll[i/k] += coll[i];
			    delete coll[i];
			    break;
			  }
			}
		}
		let answer = "";

		for (let i in coll) {
			answer += i;
			if (coll[i] > 1) answer += "^" + coll[i];
			answer += " * ";
		}

		return answer.slice(0, answer.length-3);
	}

    // 验证
  	console.log(decomp(12));//"2^10 * 3^5 * 5^2 * 7 * 11"
	// console.log(decomp(5));// "2^3 * 3 * 5"
	// console.log(decomp(22));// "2^19 * 3^9 * 5^4 * 7^3 * 11^2 * 13 * 17 * 19"
	// console.log(decomp(14));// "2^11 * 3^5 * 5^2 * 7^2 * 11 * 13"
	// console.log(decomp(25));// "2^22 * 3^10 * 5^6 * 7^3 * 11^2 * 13 * 17 * 19 * 23"
</script>