编程练习（基础篇）

1. Is a number a prime?

#include <cmath>
bool isPrime(int num) {
    if (num <= 1) {
        return false;
    }
    if (num == 2 || num == 3) {
        return true;
    }
    if (num % 2 == 0) {
        return false;
    }
    for (int i = 3; i <= std::sqrt(num); i += 2) {
        if (num % i == 0) {
            return false;
        }
    }
    return true;
}

2. A Needle in the Haystack

#include <vector>
#include <string>

std::string findNeedle(const std::vector<std::string>& haystack)
{
    // You may use the function std::to_string to convert numbers to strings for easy concatenation. 
    // E.g., ("hi" + std::to_string(123)) ==> "hi123". Of course, that's only one of many approaches.
  
    return "found the needle at position " + std::to_string(123);
}

3. Sum of positive

#include <vector>

int positive_sum (const std::vector<int> arr){
  // Your code here
  int positiveSum = 0;
  
//   for (int i = 0; i < arr.size(); i++){
//     if (arr[i] > 0){
//       positiveSum += arr[i];
//     }
//   }
  for (int num : arr){
    if (num > 0){
      positiveSum += num;
    }
  }
  
  return positiveSum;
}

4. Fake Binary

#include <string>

std::string fakeBin(std::string str){
  //your code here
  for (int i = 0; i < str.size(); i++){
    if (str[i] >= '5'){
      str[i] = '1';
    }
    else{
      str[i] = '0';
    }
  }
  
  return str;
}