https://leetcode.cn/problems/jian-sheng-zi-ii-lcof/ https://leetcode.cn/problems/jian-sheng-zi-lcof/ https://leetcode.cn/problems/special-positions-in-a-binary-matrix/

Author: masx200

README.md

@@ -10,6 +10,12 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/jian-sheng-zi-ii-lcof/
+
+https://leetcode.cn/problems/jian-sheng-zi-lcof/
+
+https://leetcode.cn/problems/special-positions-in-a-binary-matrix/
+
 https://leetcode-cn.com/problems/maximum-length-of-pair-chain/
 
 https://leetcode.cn/classic/problems/longest-univalue-path

jian-sheng-zi-ii-lcof/index.ts

@@ -0,0 +1,17 @@
+function cuttingRope(n: number): number {
+    return Number(integerBreak(BigInt(n)) % BigInt(1e9 + 7));
+}
+function integerBreak(n: bigint): bigint {
+    if (n <= 3) return n - 1n;
+    if (n % 3n === 0n) {
+        return 3n ** (n / 3n);
+    }
+    if (n % 3n === 2n) {
+        return 3n ** (n / 3n) * 2n;
+    }
+    if (n % 3n === 1n) {
+        return 3n ** (n / 3n - 1n) * 2n * 2n;
+    }
+    return n;
+}
+export default cuttingRope;

jian-sheng-zi-lcof/index.ts

@@ -0,0 +1,3 @@
+import integerBreak from "../integer-break/index.ts";
+
+export { integerBreak as default };

maximum-length-of-pair-chain/index.ts

@@ -1,5 +1,4 @@
 export default function findLongestChain(pairs: number[][]): number {
-
     let curr = -Infinity, res = 0;
     pairs.sort((a, b) => a[1] - b[1]);
     for (const p of pairs) {

special-positions-in-a-binary-matrix/index.ts

@@ -0,0 +1,17 @@
+function numSpecial(mat: number[][]): number {
+    const rowsum = mat.map((a) => a.reduce((q, v) => q + v, 0));
+    const colsum = mat[0].map((_, i) => mat.reduce((q, v) => q + v[i], 0));
+
+    let ans = 0;
+
+    mat.forEach((a, i) =>
+        a.forEach(
+            (v, j) => (ans += Number([v, colsum[j], rowsum[i]].every((v) =>
+                v === 1
+            ))),
+        )
+    );
+
+    return ans;
+}
+export default numSpecial;