Merge branch 'doocs:main' into main

Author: Daksh7112003

.prettierignore

@@ -23,4 +23,5 @@ node_modules/
 /solution/2200-2299/2205.The Number of Users That Are Eligible for Discount/Solution.sql
 /solution/2200-2299/2230.The Users That Are Eligible for Discount/Solution.sql
 /solution/2200-2299/2252.Dynamic Pivoting of a Table/Solution.sql
-/solution/2200-2299/2253.Dynamic Unpivoting of a Table/Solution.sql
+/solution/2200-2299/2253.Dynamic Unpivoting of a Table/Solution.sql
+/solution/3100-3199/3150.Invalid Tweets II/Solution.sql

basic/sorting/BubbleSort/README.md

@@ -8,6 +8,8 @@
 
 <!-- tabs:start -->
 
+#### Python3
+
 ```python
 def bubbleSort(arr):
     n = len(arr)
@@ -37,6 +39,8 @@ bubbleSort(arr)
 print(arr)
 ```
 
+#### Java
+
 ```java
 import java.util.Arrays;
 
@@ -69,6 +73,8 @@ public class BubbleSort {
 }
 ```
 
+#### C++
+
 ```cpp
 #include <iostream>
 #include <vector>
@@ -97,6 +103,8 @@ int main() {
 }
 ```
 
+#### Go
+
 ```go
 package main
 
@@ -122,6 +130,8 @@ func main() {
 }
 ```
 
+#### Rust
+
 ```rust
 fn bubble_sort(nums: &mut Vec<i32>) {
     let n = nums.len();
@@ -143,6 +153,8 @@ fn main() {
 }
 ```
 
+#### JavaScript
+
 ```js
 function bubbleSort(inputArr) {
     for (let i = inputArr.length - 1; i > 0; i--) {
@@ -168,6 +180,8 @@ const arr = [6, 3, 2, 1, 5];
 console.log(bubbleSort(arr));
 ```
 
+#### C#
+
 ```cs
 using static System.Console;
 namespace Pro;
@@ -217,5 +231,3 @@ public class Program
 ```
 
 <!-- tabs:end -->
-
-<!-- end -->

basic/sorting/HeapSort/README.md

@@ -73,6 +73,8 @@ for (int i = n / 2; i > 0; --i) {
 
 ### **Python3**
 
+#### Python3
+
 ```python
 n, m = list(map(int, input().split(" ")))
 h = [0] + list(map(int, input().split(" ")))
@@ -112,6 +114,8 @@ print(' '.join(list(map(str, res))))
 
 ### **Java**
 
+#### Java
+
 ```java
 import java.util.Scanner;
 
@@ -167,6 +171,8 @@ public class Main {
 
 ### **Rust**
 
+#### Rust
+
 ```rust
 use std::io;
 
@@ -232,6 +238,8 @@ fn main() -> io::Result<()> {
 
 ### **Go**
 
+#### Go
+
 ```go
 package main
 
@@ -286,12 +294,16 @@ func main() {
 }
 ```
 
-<!-- tabs:end -->## 解法
+<!-- tabs:end -->
+
+## 解法
 
 ### 方法一
 
 <!-- tabs:start -->
 
+#### Python3
+
 ```python
 n, m = list(map(int, input().split(" ")))
 h = [0] + list(map(int, input().split(" ")))
@@ -329,6 +341,8 @@ for i in range(m):
 print(' '.join(list(map(str, res))))
 ```
 
+#### Java
+
 ```java
 import java.util.Scanner;
 
@@ -382,6 +396,8 @@ public class Main {
 }
 ```
 
+#### Go
+
 ```go
 package main
 
@@ -436,6 +452,8 @@ func main() {
 }
 ```
 
+#### Rust
+
 ```rust
 use std::io;
 
@@ -500,5 +518,3 @@ fn main() -> io::Result<()> {
 ```
 
 <!-- tabs:end -->
-
-<!-- end -->

basic/sorting/InsertionSort/README.md

@@ -17,6 +17,8 @@
 
 <!-- tabs:start -->
 
+#### Python3
+
 ```python
 def insertion_sort(array):
     for i in range(len(array)):
@@ -34,6 +36,8 @@ array = [10, 17, 50, 7, 30, 24, 27, 45, 15, 5, 36, 21]
 print(insertion_sort(array))
 ```
 
+#### Java
+
 ```java
 import java.util.Arrays;
 
@@ -57,6 +61,8 @@ public class InsertionSort {
 }
 ```
 
+#### C++
+
 ```cpp
 #include <iostream>
 #include <vector>
@@ -96,6 +102,8 @@ int main() {
 }
 ```
 
+#### Go
+
 ```go
 package main
 
@@ -118,6 +126,8 @@ func main() {
 }
 ```
 
+#### Rust
+
 ```rust
 fn insertion_sort(nums: &mut Vec<i32>) {
     let n = nums.len();
@@ -139,6 +149,8 @@ fn main() {
 }
 ```
 
+#### JavaScript
+
 ```js
 function insertionSort(inputArr) {
     let len = inputArr.length;
@@ -158,6 +170,8 @@ let arr = [6, 3, 2, 1, 5];
 console.log(insertionSort(arr));
 ```
 
+#### C#
+
 ```cs
 using System.Diagnostics;
 using static System.Console;
@@ -197,5 +211,3 @@ public class Program
 ```
 
 <!-- tabs:end -->
-
-<!-- end -->

basic/sorting/MergeSort/README.md

@@ -73,6 +73,8 @@ void mergeSort(int[] nums, int left, int right) {
 
 <!-- tabs:start -->
 
+#### Python3
+
 ```python
 N = int(input())
 nums = list(map(int, input().split()))
@@ -110,6 +112,8 @@ merge_sort(nums, 0, N - 1)
 print(' '.join(list(map(str, nums))))
 ```
 
+#### Java
+
 ```java
 import java.util.Scanner;
 
@@ -157,6 +161,8 @@ public class Main {
 }
 ```
 
+#### C++
+
 ```cpp
 #include <iostream>
 
@@ -194,6 +200,8 @@ int main() {
 }
 ```
 
+#### Go
+
 ```go
 package main
 
@@ -246,6 +254,8 @@ func main() {
 }
 ```
 
+#### Rust
+
 ```rust
 use std::io;
 
@@ -306,6 +316,8 @@ fn main() -> io::Result<()> {
 }
 ```
 
+#### JavaScript
+
 ```js
 var buf = '';
 
@@ -362,5 +374,3 @@ process.stdin.on('end', function () {
 ```
 
 <!-- tabs:end -->
-
-<!-- end -->

basic/sorting/QuickSort/README.md

@@ -66,6 +66,8 @@ void quickSort(int[] nums, int left, int right) {
 
 <!-- tabs:start -->
 
+#### Python3
+
 ```python
 N = int(input())
 nums = list(map(int, input().split()))
@@ -95,6 +97,8 @@ quick_sort(nums, 0, N - 1)
 print(' '.join(list(map(str, nums))))
 ```
 
+#### Java
+
 ```java
 import java.util.Scanner;
 
@@ -135,6 +139,8 @@ public class Main {
 }
 ```
 
+#### C++
+
 ```cpp
 #include <iostream>
 
@@ -169,6 +175,8 @@ int main() {
 }
 ```
 
+#### Go
+
 ```go
 package main
 
@@ -217,6 +225,8 @@ func main() {
 }
 ```
 
+#### Rust
+
 ```rust
 use rand::Rng; // 0.7.2
 use std::io;
@@ -271,6 +281,8 @@ fn main() -> io::Result<()> {
 }
 ```
 
+#### JavaScript
+
 ```js
 var buf = '';
 
@@ -319,5 +331,3 @@ process.stdin.on('end', function () {
 ```
 
 <!-- tabs:end -->
-
-<!-- end -->