From b7a8cb4aa37db2d38bda2db7a567d8c0ed14bd51 Mon Sep 17 00:00:00 2001
From: EunJin Lee <sue9897@naver.com>
Date: Sun, 19 Jul 2020 00:17:24 +0900
Subject: [PATCH] Summary

---
 .../README.md"                                | 18 +++--
 .../code/isUnique_bitset.cpp"                 |  2 +-
 .../code/isUnique_bruteforce.cpp"             | 28 ++++++++
 .../explanation/isUnique_bitset.md"           |  4 +-
 .../explanation/isUnique_bruteforce.md"       | 70 +++++++++++++++++++
 5 files changed, 112 insertions(+), 10 deletions(-)
 rename "CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/isUnique_bitset/isUnique_bitset.cpp" => "CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/code/isUnique_bitset.cpp" (93%)
 create mode 100644 "CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/code/isUnique_bruteforce.cpp"
 rename "CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/isUnique_bitset/README.md" => "CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/explanation/isUnique_bitset.md" (96%)
 create mode 100644 "CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/explanation/isUnique_bruteforce.md"

diff --git "a/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/README.md" "b/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/README.md"
index 29e88f3..b4fa593 100644
--- "a/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/README.md"	
+++ "b/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/README.md"	
@@ -1,18 +1,22 @@
-# 1. Arrays and Strings > 1.1 중복이 없는가 (Is Unique)
+# 1.1 중복이 없는가 (Is Unique)
 ## 공부현황 (완료 시, 해당 칸에 공부한 날짜 적기)
 
 *`코드이해/분석` : CrackingtheCodingInterview 오픈소스 해답의 동작과정을 이해하고 모르는 것들을 정리했을 경우, 완료처리
 
 *`복습` : 해답을 보지 않고 문제를 풀고, 모르는 것들을 다시 공부한 경우, 완료처리
 
-*`내 것으로 만들기` : 해답을 보지 않고 문제를 풀었을 때 해답의 모든 경우를 다 풀 수 있는 경우, 완료처리
+*`내 것으로 만들기` : 해답을 보지 않고 문제를 풀었을 때(손코딩) 해답의 모든 경우를 다 풀 수 있는 경우, 완료처리
 
-|코드이해/분석| 복습 | 내 것으로 만들기|
-|:---:|:---:|:---:|
-||||
+|제목|코드이해/분석| 복습 | 내 것으로 만들기|
+|:---:|:---:|:---:|:---:|
+|bitset||||
+|brute_force||||
+|vector||||
+|sorting||||
 
 ## 해답종류
 #### 1. biset 이용하는 방법 👉 [`isUnique_bitset`](https://github.com/witheunjin/PS/new/master)
-#### 2. DS 사용하지 않고 푸는 방법 👉 [`isUnique_noDS`](https://github.com/witheunjin/PS/new/master)
-#### 3. vector 사용해서 푸는 방법 👉 [`isUnique_vector`](https://github.com/witheunjin/PS/new/master)
+#### 2. 완전탐색을 이용하는 방법 👉 [`isUnique_bruteforce`](https://github.com/witheunjin/PS/new/master)
+#### 3. 동적배열을 사용해서 푸는 방법 👉 [`isUnique_vector`](https://github.com/witheunjin/PS/new/master)
 #### 4. 정렬해서 푸는 방법 👉 [`isUnique_sorting`](https://github.com/witheunjin/PS/new/master)
+
diff --git "a/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/isUnique_bitset/isUnique_bitset.cpp" "b/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/code/isUnique_bitset.cpp"
similarity index 93%
rename from "CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/isUnique_bitset/isUnique_bitset.cpp"
rename to "CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/code/isUnique_bitset.cpp"
index 94bf307..b5eb267 100644
--- "a/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/isUnique_bitset/isUnique_bitset.cpp"	
+++ "b/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/code/isUnique_bitset.cpp"	
@@ -13,7 +13,7 @@ bool isUnique_bitset(const string &str) {
 }
 
 int main() {
-    cout<<"<isUnique_bitset>"<<endl;
+    cout<<"<isUnique :: bitset>"<<endl;
     string words[3] = {"apple", "mango", "kiwi"};
     for(auto word : words) {
         cout<<"input : "<<word<<endl;
diff --git "a/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/code/isUnique_bruteforce.cpp" "b/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/code/isUnique_bruteforce.cpp"
new file mode 100644
index 0000000..3c03ab0
--- /dev/null
+++ "b/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/code/isUnique_bruteforce.cpp"	
@@ -0,0 +1,28 @@
+#include <iostream>
+using namespace std;
+
+bool isUnique_brute(const string &str) {
+    for(int i=0; i<str.length()-1; ++i) {
+        for(int j=i+1; j<str.length(); ++j) {
+            if(str[i]==str[j]) {
+                cout<<"character at index "<<i<<"(="<<str[i]<<") is same as ";
+                cout<<"character at index "<<j<<"(="<<str[j]<<")"<<endl;
+                return false;
+            }
+        }
+    }
+    return true;
+}
+
+int main() {
+    cout<<"<isUnique :: brute force>"<<endl;
+    string words[3] = {"apple", "mango", "kiwi"};
+    for(auto word : words) {
+        cout<<"input : "<<word<<endl;
+        cout<<"result : ";
+        if(isUnique_brute(word)) cout<<"duplication doesn't exist"<<endl;
+        else cout<<"duplication exists"<<endl;
+        cout<<endl;
+    }
+    return 0;
+}
\ No newline at end of file
diff --git "a/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/isUnique_bitset/README.md" "b/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/explanation/isUnique_bitset.md"
similarity index 96%
rename from "CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/isUnique_bitset/README.md"
rename to "CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/explanation/isUnique_bitset.md"
index 99a3065..45ed73f 100644
--- "a/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/isUnique_bitset/README.md"	
+++ "b/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/explanation/isUnique_bitset.md"	
@@ -42,7 +42,7 @@ bool isUnique_bitset(const string &str) {
 
 ```c++
 int main() {
-    cout<<"<isUnique_bitset>"<<endl;
+    cout<<"<isUnique :: bitset>"<<endl;
     string words[3] = {"apple", "mango", "kiwi"};
     for(auto word : words) {
         cout<<"input : "<<word<<endl;
@@ -58,7 +58,7 @@ int main() {
 ## 3. result
 
 ```
-<isUnique_bitset>
+<isUnique :: bitset>
 input : apple
 result : duplication exist
 
diff --git "a/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/explanation/isUnique_bruteforce.md" "b/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/explanation/isUnique_bruteforce.md"
new file mode 100644
index 0000000..9ef75e9
--- /dev/null
+++ "b/CrackingtheCodingInterview/1.ArraysandStrings/1.1 \354\244\221\353\263\265\354\235\264 \354\227\206\353\212\224\352\260\200/explanation/isUnique_bruteforce.md"	
@@ -0,0 +1,70 @@
+# isUnique_bruteforce
+
+### 📋 contents
+
+1. code : isUnique_brute()
+2. code : main()
+3. result
+
+-----
+
+#### 📝 사전지식(prior knowledge)
+
+*null*
+
+---------
+
+## 1. code : isUnique_brute()
+
+```c++
+bool isUnique_brute(const string &str) {
+    for(int i=0; i<str.length()-1; ++i) {
+        for(int j=i+1; j<str.length(); ++j) {
+            if(str[i]==str[j]) {
+                cout<<"character at index "<<i<<"(="<<str[i]<<") is same as ";
+                cout<<"character at index "<<j<<"(="<<str[j]<<")"<<endl;
+                return false;
+            }
+        }
+    }
+    return true;
+}
+```
+
+- **완전탐색(brute force)**을 이용하여 해결.
+
+- 시간복잡도는 **O(N)** *(N은 문자의 개수)*
+
+## 2. code : main()
+
+```c++
+int main() {
+    cout<<"<isUnique :: brute force>"<<endl;
+    string words[3] = {"apple", "mango", "kiwi"};
+    for(auto word : words) {
+        cout<<"input : "<<word<<endl;
+        cout<<"result : ";
+        if(isUnique_brute(word)) cout<<"duplication doesn't exist"<<endl;
+        else cout<<"duplication exists"<<endl;
+        cout<<endl;
+    }
+    return 0;
+}
+```
+
+## 3. result
+
+```
+<isUnique :: brute force>
+input : apple
+result : character at index 1(=p) is same as character at index 2(=p)
+duplication exists
+
+input : mango
+result : duplication doesn't exist
+
+input : kiwi
+result : character at index 1(=i) is same as character at index 3(=i)
+duplication exists
+```
+