prime nummber (C)

prime nummber
給你一個n，輸出第n個質數

// Comment

#include <stdio.h>
#include <stdint.h>

#define n 10000

uint64_t primes[n];

int main(void){

  int primesSize = 2;
  primes[0] = 2;
  primes[1] = 3; // notice n must >= 2
  for(uint64_t j = 4; j < UINTMAX_MAX; ++j){
    if(primesSize >= n)
      break;
    for(int k = 0; k < primesSize; ++k){
      if(j % primes[k] == 0)
        break;
      else if(primes[k]*primes[k] > j){
        primes[primesSize] = j;
        primesSize++;
        break;
      }
    }
  }
  printf("%lu\n", primes[n-1]);


  return 0;
}

也可以使用6n+-1法 簡易版是在第一層for迴圈加入 if(j%2==0||j%3==0)continue;

even odd sort (C)

給你一個n，接下來有n個整數，對他們排序使得
(1) 偶數在奇數前面
(2) 偶數遞減排序、奇數遞增排序
然後輸出這個數列

// Comment
#include <stdio.h>
#include <stdlib.h>

int lessthan(const void * p, const void * q){
  return *(int*)p - *(int*)q;
}

int greaterthan(const void * p, const void * q){
  return *(int*)q - *(int*)p;
}

void eosort(int * arr, int arrSize){
  int *a1 = (int*)malloc(sizeof(int)*arrSize);
  int *a2 = (int*)malloc(sizeof(int)*arrSize);
  int odd_index = 0;
  int even_index = 0;
  int i;
  for(i = 0; i < arrSize; ++i){
    if(arr[i] % 2){
      a1[odd_index++] = arr[i];
    }
    else
      a2[even_index++] = arr[i];
  }
  qsort(a1, odd_index, sizeof(int), lessthan);
  qsort(a2, even_index, sizeof(int), greaterthan);

  for(i = 0; i < even_index; ++i){
    arr[i] = a2[i];
  }
  for(i = 0; i < odd_index; ++i){
    arr[i + even_index] = a1[i];
  }
}


int main(void){
  int arr[] = {0, 9, 2, 7, 4, 5, 6, 3, 8, 1, 10};
  int arrSize = 11;
  eosort(arr, arrSize);
  int i;
  for(i = 0; i < arrSize; ++i){
    printf("%d ", arr[i]);
  }
  putchar('\n');
  return 0;
}

1004. Max Consecutive Ones III (C)

// Comment
int longestOnes(int* A, int ASize, int K) {
    int result = 0;
    int localmax = 0;
    int indexOfZero = 0;
    for(int i = 0; i < ASize; ++i){
        if(A[i] == 0)
            K--;
        localmax++;
        while(K<0){
            if(A[indexOfZero] == 0){
                K++;
            }
            indexOfZero++;
            
            localmax--;
        }
        result = localmax > result ? localmax : result;
        
    }
    return result;
}