style: format code and docs with prettier

Author: yanglbme

solution/0300-0399/0368.Largest Divisible Subset/README.md

@@ -242,11 +242,11 @@ impl Solution {
     pub fn largest_divisible_subset(nums: Vec<i32>) -> Vec<i32> {
         let mut nums = nums;
         nums.sort();
-        
+
         let n = nums.len();
         let mut f = vec![1; n];
         let mut k = 0;
-        
+
         for i in 0..n {
             for j in 0..i {
                 if nums[i] % nums[j] == 0 {
@@ -257,18 +257,18 @@ impl Solution {
                 k = i;
             }
         }
-        
+
         let mut m = f[k];
         let mut ans = Vec::new();
-        
+
         for i in (0..=k).rev() {
             if nums[k] % nums[i] == 0 && f[i] == m {
                 ans.push(nums[i]);
                 k = i;
                 m -= 1;
             }
         }
-        
+
         ans
     }
 }

solution/0300-0399/0368.Largest Divisible Subset/README_EN.md

@@ -230,11 +230,11 @@ impl Solution {
     pub fn largest_divisible_subset(nums: Vec<i32>) -> Vec<i32> {
         let mut nums = nums;
         nums.sort();
-        
+
         let n = nums.len();
         let mut f = vec![1; n];
         let mut k = 0;
-        
+
         for i in 0..n {
             for j in 0..i {
                 if nums[i] % nums[j] == 0 {
@@ -245,18 +245,18 @@ impl Solution {
                 k = i;
             }
         }
-        
+
         let mut m = f[k];
         let mut ans = Vec::new();
-        
+
         for i in (0..=k).rev() {
             if nums[k] % nums[i] == 0 && f[i] == m {
                 ans.push(nums[i]);
                 k = i;
                 m -= 1;
             }
         }
-        
+
         ans
     }
 }

solution/0300-0399/0368.Largest Divisible Subset/Solution.ts

@@ -26,4 +26,4 @@ function largestDivisibleSubset(nums: number[]): number[] {
     }
 
     return ans;
-}
+}