Restyled by clang-format

restyled-commits · restyled-commits · commit 95abef508b8b · 2024-02-24T16:55:13.000Z
diff --git a/javascript/1-easy-two-sum.js b/javascript/1-easy-two-sum.js
@@ -10,4 +10,4 @@ const twoSum = (nums, target) => {
   return result;
 };
 
-twoSum([2, 7, 11, 15], 9);
+twoSum([ 2, 7, 11, 15 ], 9);
diff --git a/javascript/11-container-with-most-water.js b/javascript/11-container-with-most-water.js
@@ -14,7 +14,7 @@ var maxArea = function(height) {
     // Update the maximum area
     maxArea = Math.max(maxArea, currentArea);
 
-    //Move the pointer with the smaller height
+    // Move the pointer with the smaller height
     if (height[left] < height[right]) {
       left++;
     } else {
diff --git a/javascript/125-validPalindrom.js b/javascript/125-validPalindrom.js
@@ -14,7 +14,7 @@
  * @param {string} s
  * @return {boolean}
  */
-var isPalindrome = function (s) {
+var isPalindrome = function(s) {
   let str = s.toLowerCase();
   let finalStr = '';
   for (let i = 0; i < str.length; i++) {
@@ -23,15 +23,18 @@ var isPalindrome = function (s) {
       finalStr += str[i];
     }
   }
-  if (finalStr === finalStr.split('').reverse().join('')) return true;
+  if (finalStr === finalStr.split('').reverse().join(''))
+    return true;
   return false;
 };
 
 const checkAsciiValue = (value) => {
-  if (value.charCodeAt(0) >= 97 && value.charCodeAt(0) <= 122) return true;
-  if (value.charCodeAt(0) >= 48 && value.charCodeAt(0) <= 57) return true;
+  if (value.charCodeAt(0) >= 97 && value.charCodeAt(0) <= 122)
+    return true;
+  if (value.charCodeAt(0) >= 48 && value.charCodeAt(0) <= 57)
+    return true;
   return false;
 };
 
 console.log(isPalindrome('A man, a plan, a canal: Panama'));
-//console.log(isPalindrome('0p'));
+// console.log(isPalindrome('0p'));
diff --git a/javascript/13-easy-romatToInt.js b/javascript/13-easy-romatToInt.js
@@ -1,12 +1,12 @@
 const romanToInt = (s) => {
   const roman = {
-    I: 1,
-    V: 5,
-    X: 10,
-    L: 50,
-    C: 100,
-    D: 500,
-    M: 1000,
+    I : 1,
+    V : 5,
+    X : 10,
+    L : 50,
+    C : 100,
+    D : 500,
+    M : 1000,
   };
   let sum = 0;
   for (let i = 0; i < s.length; i++) {
diff --git a/javascript/136-singleNumber.js b/javascript/136-singleNumber.js
@@ -2,7 +2,7 @@
  * @param {number[]} nums
  * @return {number}
  */
-var singleNumber = function (nums) {
+var singleNumber = function(nums) {
   let length = nums.length;
   let uniqueVal;
   for (let i = 0; i < length; i++) {
@@ -16,4 +16,4 @@ var singleNumber = function (nums) {
   return uniqueVal;
 };
 
-console.log(singleNumber([4, 1, 2, 1, 2]));
+console.log(singleNumber([ 4, 1, 2, 1, 2 ]));
diff --git a/javascript/14-easy-longestCommonPrefix.js b/javascript/14-easy-longestCommonPrefix.js
@@ -1,13 +1,15 @@
 const longestCommonPrefix = (strs) => {
-  if (strs.length === 0) return '';
+  if (strs.length === 0)
+    return '';
   let result = '';
   for (let i = 0; i < strs[0].length; i++) {
     for (let j = 1; j < strs.length; j++) {
-      if (strs[j][i] !== strs[0][i]) return result;
+      if (strs[j][i] !== strs[0][i])
+        return result;
     }
     result += strs[0][i];
   }
   return result;
 };
 
-console.log(longestCommonPrefix(['flower', 'flow', 'flight']));
+console.log(longestCommonPrefix([ 'flower', 'flow', 'flight' ]));
diff --git a/javascript/20-easy-validParenthesis.js b/javascript/20-easy-validParenthesis.js
@@ -1,10 +1,11 @@
 const isValid = (str) => {
-  if (str.length % 2 !== 0) return false;
+  if (str.length % 2 !== 0)
+    return false;
   const stack = [];
   const map = {
-    '(': ')',
-    '[': ']',
-    '{': '}',
+    '(' : ')',
+    '[' : ']',
+    '{' : '}',
   };
   for (let i = 0; i < str.length; i++) {
     if (str[i] === '(' || str[i] === '[' || str[i] === '{') {
diff --git a/javascript/205-isomorphicCharacter.js b/javascript/205-isomorphicCharacter.js
@@ -1,5 +1,5 @@
 
-var isIsomorphic = function (s, t) {
+var isIsomorphic = function(s, t) {
   let map = new Map();
   let map2 = new Map();
   for (let i = 0; i < s.length; i++) {
@@ -16,5 +16,5 @@ var isIsomorphic = function (s, t) {
 };
 
 console.log(isIsomorphic('egg', 'add'));
-//console.log(isIsomorphic('ffo', 'bar'));
-//console.log(isIsomorphic('paper', 'title'));
+// console.log(isIsomorphic('ffo', 'bar'));
+// console.log(isIsomorphic('paper', 'title'));
diff --git a/javascript/21-easy-mergeTwoSortedList.js b/javascript/21-easy-mergeTwoSortedList.js
@@ -1,6 +1,8 @@
 const mergeTwoLists = (l1, l2) => {
-  if (!l1) return l2;
-  if (!l2) return l1;
+  if (!l1)
+    return l2;
+  if (!l2)
+    return l1;
   if (l1.val < l2.val) {
     l1.next = mergeTwoLists(l1.next, l2);
     return l1;
@@ -9,4 +11,4 @@ const mergeTwoLists = (l1, l2) => {
   return l2;
 };
 
-console.log(mergeTwoLists([1, 2, 4], [1, 3, 4]));
+console.log(mergeTwoLists([ 1, 2, 4 ], [ 1, 3, 4 ]));
diff --git a/javascript/217-containsDuplicate.js b/javascript/217-containsDuplicate.js
@@ -22,9 +22,9 @@
  * @param {number[]} nums
  * @return {boolean}
  */
-var containsDuplicate = function (nums) {
+var containsDuplicate = function(nums) {
   let unique = new Set(nums);
   return unique.size !== nums.length;
 };
 
-console.log(containsDuplicate([1, 2, 3, 4]));
+console.log(containsDuplicate([ 1, 2, 3, 4 ]));
diff --git a/javascript/26-easy-removeDuplicates.js b/javascript/26-easy-removeDuplicates.js
@@ -1,5 +1,5 @@
 
-var removeDuplicates = function (nums) {
+var removeDuplicates = function(nums) {
   let i = 0;
   while (i < nums.length) {
     if (nums[i] === nums[i + 1]) {
@@ -10,4 +10,4 @@ var removeDuplicates = function (nums) {
   }
   return nums.length;
 };
-console.log(removeDuplicates([0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 3, 4]));
+console.log(removeDuplicates([ 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 3, 4 ]));
diff --git a/javascript/260-singleNumber2.js b/javascript/260-singleNumber2.js
@@ -2,9 +2,9 @@
  * @param {number[]} nums
  * @return {number}
  */
-var singleNumber = function (nums) {
+var singleNumber = function(nums) {
   let length = nums.length;
-  let uniqueVal=[];
+  let uniqueVal = [];
   for (let i = 0; i < length; i++) {
     let unique = nums.filter((item) => item === nums[i]);
     if (unique.length === 1) {
@@ -15,4 +15,4 @@ var singleNumber = function (nums) {
   return uniqueVal;
 };
 
-console.log(singleNumber([1,2,1,3,2,5]));
+console.log(singleNumber([ 1, 2, 1, 3, 2, 5 ]));
diff --git a/javascript/2620-counter.js b/javascript/2620-counter.js
@@ -2,7 +2,7 @@
  * @param {number} n
  * @return {Function} counter
  */
-var createCounter = function (n) {
+var createCounter = function(n) {
   let count = n;
 
   function counter() {
@@ -16,9 +16,9 @@ var createCounter = function (n) {
 
 const counter = createCounter(5);
 
-console.log(counter());  // Output: 5
-console.log(counter());  // Output: 6
-console.log(counter());  // Output: 7
-console.log(counter());  // Output: 8
-console.log(counter());  // Output: 9
-console.log(counter());  // Output: 10
+console.log(counter()); // Output: 5
+console.log(counter()); // Output: 6
+console.log(counter()); // Output: 7
+console.log(counter()); // Output: 8
+console.log(counter()); // Output: 9
+console.log(counter()); // Output: 10
diff --git a/javascript/2667.js b/javascript/2667.js
@@ -1,8 +1,5 @@
 /**
  * @return {Function}
  */
-var createHelloWorld = function () {
-  return function (...args) {
-    return 'Hello World';
-  };
-};
+var createHelloWorld =
+    function() { return function(...args) { return 'Hello World'; }; };
diff --git a/javascript/27-easy-removeElement.js b/javascript/27-easy-removeElement.js
@@ -1,4 +1,4 @@
-var removeElement = function (nums, val) {
+var removeElement = function(nums, val) {
   for (let i = 0; i < nums.length; i++) {
     if (nums[i] === val) {
       nums.splice(i, 1);
diff --git a/javascript/2704-to-be-or-not-be.js b/javascript/2704-to-be-or-not-be.js
@@ -2,14 +2,16 @@
  * @param {string} val
  * @return {Object}
  */
-var expect = function (val) {
+var expect = function(val) {
   return {
-    toBe: function (expected) {
-      if (val === expected) return true;
+    toBe : function(expected) {
+      if (val === expected)
+        return true;
       throw new Error('Not Equal');
     },
-    notToBe: function (expected) {
-      if (val !== expected) return true;
+    notToBe : function(expected) {
+      if (val !== expected)
+        return true;
       throw new Error('Equal');
     },
   };
diff --git a/javascript/344-reverseString.js b/javascript/344-reverseString.js
@@ -2,7 +2,7 @@
  * @param {character[]} s
  * @return {void} Do not return anything, modify s in-place instead.
  */
-var reverseString = function (s) {
+var reverseString = function(s) {
   let left = 0;
   let right = s.length - 1;
   while (left < right) {
@@ -16,4 +16,4 @@ var reverseString = function (s) {
   return s;
 };
 
-console.log(reverseString(["h", "e", "l", "l", "o"]));
+console.log(reverseString([ "h", "e", "l", "l", "o" ]));
diff --git a/javascript/35-easy-searchInsertPosition.js b/javascript/35-easy-searchInsertPosition.js
@@ -13,4 +13,4 @@ const searchInsert = (nums, target) => {
   }
 };
 
-console.log(searchInsert([1, 3, 5, 6], 7)); // 2
+console.log(searchInsert([ 1, 3, 5, 6 ], 7)); // 2
diff --git a/javascript/3_longest_substring.js b/javascript/3_longest_substring.js
@@ -1,22 +1,21 @@
-//3. Longest Substring Without Repeating Characters
-// Given a string, find the length of the longest substring without repeating characters.
-// Example 1:
-// Input: "abcabcbb"
-// Output: 3
-// Explanation: The answer is "abc", with the length of 3.
+// 3. Longest Substring Without Repeating Characters
+//  Given a string, find the length of the longest substring without repeating
+//  characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer
+//  is "abc", with the length of 3.
 
 /**
  * @param {string} s
  * @return {number}
  */
-var lengthOfLongestSubstring = function (s) {
+var lengthOfLongestSubstring = function(s) {
   let longest = 0;
   let seen = {};
   let start = 0;
 
   for (let i = 0; i < s.length; i++) {
     let char = s[i];
-    if (seen[char]) start = Math.max(start, seen[char]);
+    if (seen[char])
+      start = Math.max(start, seen[char]);
 
     longest = Math.max(longest, i - start + 1);
     seen[char] = i + 1;
diff --git a/javascript/4-findMedianSortedArrays.js b/javascript/4-findMedianSortedArrays.js
@@ -3,12 +3,12 @@
  * @param {number[]} nums2
  * @return {number}
  */
-var findMedianSortedArrays = function (nums1, nums2) {
+var findMedianSortedArrays = function(nums1, nums2) {
   let nums = nums1.concat(nums2);
   nums.sort((a, b) => a - b);
   let len = nums.length;
   let mid = Math.floor(len / 2);
   return len % 2 === 0 ? (nums[mid] + nums[mid - 1]) / 2 : nums[mid];
 };
 
-findMedianSortedArrays([1, 2], [3, 4]);
+findMedianSortedArrays([ 1, 2 ], [ 3, 4 ]);
diff --git a/javascript/66-easy-plusOne.js b/javascript/66-easy-plusOne.js
@@ -11,4 +11,4 @@ const plusOne = (digits) => {
   return digits;
 };
 
-plusOne([9,9]);
+plusOne([ 9, 9 ]);
diff --git a/javascript/67-addBinary.js b/javascript/67-addBinary.js
@@ -1,6 +1,5 @@
 const addBinary = (a, b) => {
-  let sum = '',
-    carry = 0;
+  let sum = '', carry = 0;
 
   a = a.split('');
   b = b.split('');
@@ -12,7 +11,8 @@ const addBinary = (a, b) => {
     sum = (temp % 2) + sum;
     carry = Math.floor(temp / 2);
   }
-  if (carry) sum = carry + sum;
+  if (carry)
+    sum = carry + sum;
 
   return sum;
 };
diff --git a/javascript/69-Sqrt.js b/javascript/69-Sqrt.js
@@ -6,7 +6,7 @@
 //   return Math.floor(Math.sqrt(x));
 // };
 
-var mySqrt = function (x) {
+var mySqrt = function(x) {
   let i = 1;
   let sqr = i * i;
 
diff --git a/javascript/88-margSortedArray.js b/javascript/88-margSortedArray.js
@@ -2,11 +2,12 @@
 Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
 Output: [1,2,2,3,5,6]
 Explanation: The arrays we are merging are [1,2,3] and [2,5,6].
-The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1. 
+The result of the merge is [1,2,2,3,5,6] with the underlined elements coming
+from nums1.
 */
 
-var merge = function (nums1, m, nums2, n) {
-  var index = m + n - 1; //last index
+var merge = function(nums1, m, nums2, n) {
+  var index = m + n - 1; // last index
   while (n > 0) {
     if (m > 0 && nums1[m - 1] > nums2[n - 1]) {
       nums1[index] = nums1[m - 1];
@@ -19,4 +20,4 @@ var merge = function (nums1, m, nums2, n) {
   }
 };
 
-console.log(merge([1, 2, 3, 0, 0, 0], 3, [2, 5, 6], 3));
+console.log(merge([ 1, 2, 3, 0, 0, 0 ], 3, [ 2, 5, 6 ], 3));
diff --git a/javascript/P-Array-AddNumberFromArray.js b/javascript/P-Array-AddNumberFromArray.js
@@ -10,7 +10,7 @@
  * @param {ListNode} l2
  * @return {ListNode}
  */
-var addTwoNumbers = function (l1, l2) {
+var addTwoNumbers = function(l1, l2) {
   let len = l1.length > l2.length ? l1.length : l2.length;
   let sLen = l1.length < l2.length ? l1.length : l2.length;
   let carry = 0;
@@ -36,8 +36,9 @@ var addTwoNumbers = function (l1, l2) {
       }
     }
   }
-  if (carry > 0) sum.push(carry);
+  if (carry > 0)
+    sum.push(carry);
   return sum;
 };
 
-addTwoNumbers([2, 4, 3], [5, 6, 4]);
+addTwoNumbers([ 2, 4, 3 ], [ 5, 6, 4 ]);
