NiklasJang niklasjang

## var-let-const.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                niklasjang
                / var-let-const.md
            
            
              Last active
              October 7, 2019 02:22
                — forked from LeoHeo/var-let-const.md
            
              
                javascript var, let, const 차이점
              
          
    var, let, const 차이점은?


var는 function-scoped이고, let, const는 block-scoped입니다.


function-scoped와 block-scoped가 무슨말이냐?


var(function-scoped)

jsfiddle 참고주소


## boj15651.cpp
#include <iostream>
using namespace std;

int n=0, k=0;
int arr[100];
void recur(int depth){
  if(depth == n){
    for(int j=0; j<n; j++){
      cout << arr[j] <<" ";
    }

## boj15649.cpp
#include <iostream>
using namespace std;

int n=0, k=0;
bool visited[100];
int arr[100];
void recur(int depth){
  if(depth == n){
    for(int j=0; j<n; j++){
      cout << arr[j] <<' ';

## boj15650_0.cpp
#include <iostream>
using namespace std;

int n=0, k=0;
int arr[100];

void recur(int depth){
  if(depth == n){
    for(int j=0; j<n; j++){
      cout << arr[j] <<' ';

## boj15650_1.cpp
#include <iostream>
using namespace std;

int n=0, k=0;
int arr[100];

void recur(int depth, int start){
  if(depth == n){
    for(int j=0; j<n; j++){
      cout << arr[j] <<' ';

## boj15652.cpp
#include <iostream>
using namespace std;

int n=0, k=0;
int arr[100];

void recur(int depth, int start){
  if(depth == n){
    for(int j=0; j<n; j++){
      cout << arr[j] <<' ';

## boj15656.cpp

#include <iostream>
#include <algorithm>
using namespace std;

int n=0, k=0;
int input[100];
int arr[100];
void recur(int depth){
  if(depth == n){

## boj2023.cpp

#include <iostream>
using namespace std;

int n=0;

bool isPrime(int num){
  if(num == 0) return true;
  if(num == 1) return false;
  int cnt = 0;

## boj1759_0.cpp
#include <iostream>
#include <algorithm>
using namespace std;

int n=0, k=0;
int mo=0, za=0;
char input[20];
char arr[100];
bool visited[20];
void recur(int depth, int mcnt, int zcnt){

## boj1759_1.cpp
#include <iostream>
#include <algorithm>
using namespace std;

int n=0, k=0;
int mo=0, za=0;
char input[20];
char arr[100];
bool visited[20];
void recur(int depth, int start, int mcnt, int zcnt){
	#include <iostream>
	using namespace std;

	int n=0, k=0;
	int arr[100];
	void recur(int depth){
	if(depth == n){
	for(int j=0; j<n; j++){
	cout << arr[j] <<" ";
	}

	#include <iostream>
	#include <algorithm>
	using namespace std;

	int n=0, k=0;
	int input[100];
	int arr[100];
	void recur(int depth){
	if(depth == n){

	#include <iostream>
	using namespace std;

	int n=0;

	bool isPrime(int num){
	if(num == 0) return true;
	if(num == 1) return false;
	int cnt = 0;