Solutions for Ex 103 and Ex104

shangpin21 · shangpin21 · commit c90fb01e9d14 · 2024-06-15T00:14:14.000+08:00
diff --git a/Ex103/index.html b/Ex103/index.html
@@ -0,0 +1,16 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Ex 103</title>
+    <h1>Excercise 103</h1>
+    <script src="index.js"></script>
+</head>
+<body>
+    <p> 
+        Write a JavaScript program to find the maximum number of a given positive integer by deleting exactly one digit of the given number.     
+    </p>
+
+</body>
+</html>
diff --git a/Ex103/index.js b/Ex103/index.js
@@ -1,9 +1,32 @@
 // declare function with a given string as the parameter
 
-const build_palindrome = (str) => {
-    
+const digit_delete = (num) => {
+    let result = 0, // variable to store maximum resulting number
+    num_digits = []; // Array to store individual digits of the number
+
+    // Extract digits of the number and store them in an array
+    while(num){
+        num_digits.push(num % 10);
+        num = Math.floor(num / 10);
+    }
+    // Iterate through each digit and generate numbers after deleting each digit
+    for(let i = 0; i < num_digits.length; i++){
+        let temp = 0; // Temporary variable to store generated number
+
+        // Create a new number without the current indexed digit
+        for(let j = num_digits.length - 1; j >= 0; j--){
+            if(j !== i) {
+                temp = temp * 10 + num_digits[j];
+            }
+        }
+
+        // Store the maximum number obtained after deleting each digit
+        result = Math.max(temp, result);
+    }
+
+    return result;
 };
    
 
 
-console.log(build_palindrome());
+console.log(digit_delete(123));
diff --git a/Ex104/index.html b/Ex104/index.html
@@ -0,0 +1,17 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Ex 104</title>
+    <h1>Excercise 104</h1>
+    <script src="index.js"></script>
+</head>
+<body>
+    <p> 
+        Write a JavaScript program to find two elements of an array such that their absolute difference is not larger than a given integer. <br>
+        However, it is as close as possible to the integer.     
+    </p>
+
+</body>
+</html>
diff --git a/Ex104/index.js b/Ex104/index.js
@@ -1,24 +1,16 @@
-// Function to build a palindrome from a given string
-const build_Palindrome = (new_str) => {
-    let flag;  // Variable to check if a palindrome is found
-    for (let i = new_str.length;; i++) {  // Infinite loop starting from the length of the input string
-      flag = true;  // Reset the flag for each iteration
-      for (let j = 0; j < i - j - 1; j++) {
-        // Check if the characters symmetrically positioned around the center are equal
-        if (i - j - 1 < new_str.length && new_str[j] !== new_str[i - j - 1]) {
-          flag = false;  // Set the flag to false if not equal
-          break;  // Break the inner loop
+// Function with an array and a given number as the parameters
+const different_values = (arr, n) => {
+    let max_value = -1; // initializing max value as -1
+    for(let i = 0; i < arr.length; i++){
+      // nested loop for comparison with subsequent elements
+      for(let j = i + 1; j < arr.length; j++){
+        let x = Math.abs(arr[i] - arr[j]); // Calculating absolute difference
+        if(x <= n){ // checking if absolute difference is smaller than n
+          max_value = Math.max(max_value,x); // Updating the maximum value if the condition is met
         }
       }
-      if (flag) {
-        // If a palindrome is found, complete the palindrome by adding the remaining characters
-        for (let j = new_str.length; j < i; j++) {
-          new_str += new_str[i - j - 1];
-        }
-        return new_str;  // Return the palindrome
-      }
     }
-  }
+    return max_value; // Returning max value
+}
   
-  console.log(build_Palindrome("abcddc"));  // Example usage
-  console.log(build_Palindrome("122"));  // Example usage
+console.log(different_values([12,10,33,34], 10));
diff --git a/Ex57/index.html b/Ex57/index.html
@@ -3,13 +3,13 @@
 <head>
     <meta charset="UTF-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>Ex 56</title>
-    <h1>Excercise 56</h1>
+    <title>Ex 57</title>
+    <h1>Excercise 57</h1>
     <script src="index.js"></script>
 </head>
 <body>
     <p> 
-        Write a JavaScript program to divide two positive numbers and return the result as string with properly formatted commas.
+        Write a JavaScript program to create one string of specified copies (positive numbers) of a given string.
     </p>
 
 </body>
diff --git a/Ex59/index.html b/Ex59/index.html
@@ -9,8 +9,7 @@ <h1>Excercise 59</h1>
 </head>
 <body>
     <p> 
-        Write a JavaScript program to create an updated string of 4 copies of the last 3 characters of a given original string.<br>
-         The string length must be 3 and above.  
+        Write a JavaScript program to extract the first half of a even string.   
     </p>
 
 </body>
diff --git a/Ex60/index.html b/Ex60/index.html
@@ -9,8 +9,7 @@ <h1>Excercise 60</h1>
 </head>
 <body>
     <p> 
-        Write a JavaScript program to create an updated string of 4 copies of the last 3 characters of a given original string.<br>
-         The string length must be 3 and above.  
+        Write a JavaScript program to create a new string without the first and last characters of a given string.  
     </p>
 
 </body>
