[c++] 1차 비밀지도 (구현)

#include <string>
#include <vector>
using namespace std;
 
int N;
vector<string> board1;
vector<string> board2;
vector<string> answer;
string Change(int num){
    string ans="";
    int s=(1<<N-1);
    while(s){
        if(num>=s){
            num=num%s;
            s=(s>>1);
            ans+="1";
        }else{
            s=(s>>1);
            ans+="0";
        }
    }
    return ans;
}
 
string Ret(string a,string b){
    string ans="";
    for(int i=0;i<N;i++){
        if( (a[i]=='1') || (b[i]=='1') ){
            ans+="#";
        }else
            ans+=" ";     
    }
    return ans;
}
 
vector<string> solution(int n, vector<int> arr1, vector<int> arr2) {
 
    N=n;
    for(int i=0;i<n;i++){
        board1.push_back(Change(arr1[i]));
        board2.push_back(Change(arr2[i]));
    }
    for(int i=0;i<n;i++){
        answer.push_back(Ret(board1[i],board2[i]));
    }
    
    return answer;
}

출처:https://school.programmers.co.kr/learn/courses/30/lessons/17681?language=cpp

 

#include <string>
#include <vector>
using namespace std;
 
int N;
vector<string> answer;
string Change(int num){
    string ans="";
    int s=(1<<N-1);
    while(s){
        if(num>=s){
            num=num%s;
            s=(s>>1);
            ans+="#";
        }else{
            s=(s>>1);
            ans+=" ";
        }
    }
    return ans;
}
 
vector<string> solution(int n, vector<int> arr1, vector<int> arr2) {
 
    N=n;
    
    for(int i=0;i<n;i++){
        arr1[i]=arr1[i] | arr2[i];
    }
    for(int i=0;i<n;i++){
        answer.push_back(Change(arr1[i]));
    }
    
    return answer;
}

처음부터 OR연산하는 방법을 생각못했네요