Skip to content

Commit 05e7b5f

Browse files
committed
feat: add typescript solution to lc problem: No.2320
No.2320.Count Number of Ways to Place Houses
1 parent def6e79 commit 05e7b5f

File tree

3 files changed

+24
-2
lines changed

3 files changed

+24
-2
lines changed

solution/2300-2399/2320.Count Number of Ways to Place Houses/README.md

+8-1
Original file line numberDiff line numberDiff line change
@@ -127,7 +127,14 @@ func countHousePlacements(n int) int {
127127
### **TypeScript**
128128

129129
```ts
130-
130+
function countHousePlacements(n: number): number {
131+
const mod = BigInt(10 ** 9 + 7);
132+
let pre = 1n, count = 2n;
133+
for (let i = 2; i <= n; i++) {
134+
[count, pre] = [(count + pre) % mod, count];
135+
}
136+
return Number(count ** 2n % mod);
137+
};
131138
```
132139

133140
### **...**

solution/2300-2399/2320.Count Number of Ways to Place Houses/README_EN.md

+8-1
Original file line numberDiff line numberDiff line change
@@ -118,7 +118,14 @@ func countHousePlacements(n int) int {
118118
### **TypeScript**
119119

120120
```ts
121-
121+
function countHousePlacements(n: number): number {
122+
const mod = BigInt(10 ** 9 + 7);
123+
let pre = 1n, count = 2n;
124+
for (let i = 2; i <= n; i++) {
125+
[count, pre] = [(count + pre) % mod, count];
126+
}
127+
return Number(count ** 2n % mod);
128+
};
122129
```
123130

124131
### **...**
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
function countHousePlacements(n: number): number {
2+
const mod = BigInt(10 ** 9 + 7);
3+
let pre = 1n, count = 2n;
4+
for (let i = 2; i <= n; i++) {
5+
[count, pre] = [(count + pre) % mod, count];
6+
}
7+
return Number(count ** 2n % mod);
8+
};

0 commit comments

Comments
 (0)