Merge pull request div-bargali#863

Korean translation of Readme, Contributing and Code of Conduct files and comments added to some files.

Author: div-bargali

C++/Algorithms/Backtracking/Permutation_of_string.cpp

@@ -4,7 +4,7 @@ using namespace std;
 // Function to find all Permutations of a given string str[i..n-1]
 // containing all distinct characters and which u want to change
 
-void permutations(string str, int i, int n,int j, int k )
+void permutations(string str, int i, int n)
 {
  // base condition
  if (i == n - 1)
@@ -35,4 +35,4 @@ int main()
  permutations(str, 0, str.length());
 
  return 0;
-}
+}

C++/Algorithms/Backtracking/RAT_IN_MAZE_problem.cpp

@@ -0,0 +1,53 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+void printSolution(int** solution, int n) { //if we find out solution then print out full path 
+ for (int i = 0; i < n; i++) {
+ for (int j = 0; j < n; j++) {
+ cout << solution[i][j] << " ";
+ }
+ }
+ cout << endl;
+}
+void mazeHelp(int maze[][20], int n, int** solution, int x, int y) { //
+
+
+ if (x == n - 1 && y == n - 1) { //when x,y reaches the end of point
+ solution[x][y] = 1;
+ printSolution(solution, n);
+ return;
+ }
+ if (x >= n || x < 0 || y >= n || y < 0 || maze[x][y] == 0 || solution[x][y] == 1) { //whether x,y is out of map or coordinate which can be used as a path 
+ return;
+ }
+ solution[x][y] = 1; //it has been used to solution path
+ mazeHelp(maze, n, solution, x - 1, y);
+ mazeHelp(maze, n, solution, x + 1, y);
+ mazeHelp(maze, n, solution, x, y - 1);
+ mazeHelp(maze, n, solution, x, y + 1);
+ solution[x][y] = 0; //backtracking
+}
+
+
+void ratInAMaze(int maze[][20], int n) {
+ int** solution = new int* [n];
+ for (int i = 0; i < n; i++) {
+ solution[i] = new int[n];
+ }
+ mazeHelp(maze, n, solution, 0, 0);
+}
+
+
+
+int main() {
+
+ int n;
+ cin >> n; //n representing dimension of the maze
+ int maze[20][20];
+ for (int i = 0; i < n; i++) {
+ for (int j = 0; j < n; j++) {
+ cin >> maze[i][j]; //n space-separated integers representing the type of the cell
+ }
+ }
+ ratInAMaze(maze, n);
+}

C++/Algorithms/Mathematical/Armstrong_number_comment.cpp

@@ -0,0 +1,35 @@
+/*
+This function is a function that calculates the sum of the number of digits in the integer entered by the user by the number of digits in the entered integer.
+If the number is the same as the number initially entered, it prints that the Armstrong number is correct, and if it is different, it prints that it is not.
+*/
+#include <cmath>
+#include <iostream>
+
+using namespace std;
+
+int main() {
+ int n, ognum, d, ct = 0, sum = 0, power;
+ cout << "Enter an integer: ";
+ cin >> n;
+
+ ognum = n;
+
+ while (ognum != 0) { // Finding the number of digits of the input integer
+ ognum /= 10;
+ ++ct;
+ }
+ ognum = n;
+
+ while (ognum != 0) { // Square the numbers in each digit by the number of digits in the input integer. Then, the squared numbers are added together
+ d = ognum % 10;
+ power = round(pow(d, ct));
+ sum += power;
+ ognum /= 10;
+ }
+
+ if (sum == n) // Armstrong's number if the sum of the number of digits from the inputted integers squared by the number of digits received is equal to the number initially input
+ cout << n << " is an Armstrong number.";
+ else // If it's wrong, it's not Armstrong's number.
+ cout << n << " is not an Armstrong number.";
+ return 0;
+}

C++/Algorithms/Mathematical/Lucky_number.cpp renamed to C++/Algorithms/Mathematical/Lucky_number_comment.cpp

@@ -1,3 +1,8 @@
+/*
+This function receives the value of n1 from the user, and outputs a "lucky number" 
+if there is a duplicate number among the input numbers, and a "not lucky number" if there is no duplicate number.
+*/
+
 #include<iostream>
 using namespace std;
 
@@ -7,10 +12,10 @@ int main() {
  cin>>n1;
  n2=n1;
  n=n1;
- while(n1>0)
+ while(n1>0) 
  {
  d1=n1%10;
- while(n2>0)
+ while(n2>0) 
  {
  d2=n2%10;
  if(d1==d2)
@@ -26,9 +31,9 @@ int main() {
  n2=n;
  n1=n1/10;
  }
- if(flag==1)
+ if(flag==1) // flag == 1 it means that the numbers do overlap
  cout<<n<<" is not a lucky number";
- else 
+ else // flag != 1 it means that there is even one duplicate number
  cout<<n<<" is a lucky number";
  return 0;
 }

C++/Data-Structures/Array/Move-neg-to-left_comment.cpp

@@ -0,0 +1,45 @@
+#include<bits/stdc++.h>
+using namespace std;
+void printArray(int array[], int size) { 
+ for (int i = 0; i < size; ++i) {
+ cout << array[i] << " "; //print array
+ } 
+ cout << endl;
+} 
+void shiftArray(int array[], int size) { 
+ int left = 0, right = size-1;
+ while(left <= right) { //sorting
+ if(array[left] < 0 && array[right] < 0) {
+ left++;
+ }
+ else if(array[left] < 0 && array[right] > 0) {
+ right--;
+ }
+ else if(array[left] > 0 && array[right] < 0) {
+ swap(array[left], array[right]);
+ right--;
+ left++;
+ }
+ else {
+ right--;
+ }
+ }
+} 
+int main() {
+ int size;
+ cout << "Enter the size of array:\n";
+ cin >> size; //input size
+ int array[size];
+ cout << "Enter the elements of the array:\n";
+ for(int i = 0; i < size; ++i) {
+ cin >> array[i]; //input value
+ }
+ cout << "Original Array:\t";
+ printArray(array, size); //print original array
+ cout << "After moving all negative elements to left:\t";
+ shiftArray(array, size); //Run sorting function
+ printArray(array, size); //print shift array
+ return 0;
+}
+
+

C++/Data-Structures/Array/PositiveAtEvenNegativeAtOdd_comment.c++

@@ -0,0 +1,46 @@
+#include <iostream>
+using namespace std;
+#define ll long long int
+#define MAXSIZE 100
+
+int main() {
+ ll arr[MAXSIZE] = {NULL, } ,i=0;
+ while(cin>>arr[i]){
+ i++; //input value (if value is ^z[ctrl + z] break while)
+ }
+ ll n = i;
+ 
+ ll pos[MAXSIZE],neg[MAXSIZE];
+ ll pi=0,pn=0,xp=0,xn=0;
+ for(i=0;i<n;i++){ //first sorting
+ if(arr[i] >= 0){
+ pos[pi] = arr[i]; //positive number = pos[]
+ pi++;
+ }
+ else{
+ neg[pn] = arr[i]; //negative number = neg[]
+ pn++;
+ }
+ } 
+ for(i=0;i<n;i++){ //second sorting
+ if(i%2==0 && xp<pi){
+ arr[i] = pos[xp]; //if i = even and xp < pi
+ xp++;
+ }
+ else if(i%2!=0 && xn<pn){//else if i = odd and xn < pn
+ arr[i] = neg[xn];
+ xn++;
+ }
+ else if(xp>=pi){ //else if xp >= pi
+ arr[i] = neg[xn++];
+ }
+ else if(xn>=pn){
+ arr[i] = pos[xp++]; //else if xn >= pn
+ }
+ }
+ 
+ for(i=0;i<n;i++){
+ cout<<arr[i]<<" "; //print Array completed sorting
+ }
+ return 0;
+}

C++/Data-Structures/Array/Remove_duplicates_add_example.cpp

@@ -0,0 +1,60 @@
+/*Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns the new length.
+
+Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
+Only adjacent values are deleted.
+ex) 12333333
+= 123
+ex2)
+1234512345
+= 1234512345
+
+*/
+#include<bits/stdc++.h>
+using namespace std;
+int removeDuplicates(vector<int>& nums) // this function returns length
+{
+ int l = 0, i, c = 0;
+
+ for (i = 0; i < nums.size(); i++) // l stores the number of distcinct elements in the array
+ {
+ if (i == 0)
+ {
+ l++; continue;
+ }
+ if (nums[i] == nums[i - 1])
+ continue;
+ else
+ l++;
+ }
+ for (i = 0; i < nums.size(); i++)
+ {
+ if (i == 0)
+ {
+ c++; continue;
+ }
+ if (nums[i] != nums[i - 1]) //as soon a new element is encountered it is paced at index c
+ {
+ nums[c] = nums[i];
+ c++;
+ if (c == l) //it checks all the distcinct elements have been alloted in the first l indices
+ break;
+ }
+ }
+ return l;
+}
+int main()
+{
+ vector<int> nums;
+ int n, i;
+ cin >> n;
+ for (i = 0; i < n; i++) //takes input fro/m user
+ {
+ int b;
+ cin >> b;
+ nums.push_back(b);
+ }
+ int len = removeDuplicates(nums);
+ for (i = 0; i < len; i++) //prints the required distinct elements
+ cout << nums[i] << " ";
+ return 0;
+}