Movatterモバイル変換

Skip to content

coder-faker/leetcodePublic

forked frombegeekmyfriend/leetcode

NotificationsYou must be signed in to change notification settings
Fork0
Star1

Commitd5f5f97

begeekmyfriend

committed

Add C++ implementation

Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>

1 parent668052e commitd5f5f97Copy full SHA for d5f5f97

File tree

2 files changed

+32

-4

lines changed

0204_count_primes
- count_primes.cc
- count_primes.c

2 files changed

+32

-4

lines changed

`‎0204_count_primes/count_primes.c‎`

Lines changed: 6 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,12 +1,14 @@`
`1`	`1`	`#include<stdio.h>`
`2`	`2`	`#include<stdlib.h>`
`3`	`3`	`#include<stdbool.h>`
`4`		`-#include<string.h>`
`5`	`4`
`6`		`-staticintcountPrimes(intn)`
	`5`	`+`
	`6`	`+intcountPrimes(intn)`
`7`	`7`	`{`
`8`		`-if (n<3)return0;`
`9`		`-`
	`8`	`+if (n<3) {`
	`9`	`+return0;`
	`10`	`+ }`
	`11`	`+`
`10`	`12`	`inti,j;`
`11`	`13`	`bool*marked=malloc(n);`
`12`	`14`	`memset(marked, false,n);`

`‎0204_count_primes/count_primes.cc‎`

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,26 @@`
	`1`	`+#include<stdc++.h>`
	`2`	`+`
	`3`	`+usingnamespacestd;`
	`4`	`+`
	`5`	`+classSolution {`
	`6`	`+public:`
	`7`	`+intcountPrimes(int n) {`
	`8`	`+if (n <3) {`
	`9`	`+return0;`
	`10`	`+ }`
	`11`	`+`
	`12`	`+ vector<bool>marked(n);`
	`13`	`+int count = n >>1;`
	`14`	`+for (int i =3; i * i <= n; i +=2) {`
	`15`	`+if (!marked[i]) {`
	`16`	`+for (int j = i * i; j < n; j += (i <<1)) {`
	`17`	`+if (!marked[j]) {`
	`18`	`+ marked[j] =true;`
	`19`	`+ --count;`
	`20`	`+ }`
	`21`	`+ }`
	`22`	`+ }`
	`23`	`+ }`
	`24`	`+return count;`
	`25`	`+ }`
	`26`	`+};`

0 commit comments

Comments

(0)

[8]ページ先頭

©2009-2025 Movatter.jp