Skip to content

Adding leetcode Rotate Array (189.c) and Count Primes (204.c) #473

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 1 commit into from
Closed

Conversation

andre143
Copy link
Contributor

Leetcode Solution:
Problem 189: Rotate Array
Problem 204: Count Primes
#249

int countPrimes(int n){
int count = 0;
int isPrime;
for (int i = 2; i <= n; i++){
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It is fail the testcase n = 2. Expected output : 0, your output : 1

@andre143 andre143 closed this Oct 29, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants