simulation topics

Barklim · Barklim · commit c71e97f81cca · 2025-03-13T18:34:30.000+03:00
diff --git a/0013-roman-to-integer.js b/0013-roman-to-integer.js
@@ -46,3 +46,26 @@ var romanToInt = function(s) {
     return result;
   }, 0);
 };
+
+// var romanToInt = function(s) {
+//   let res = 0;
+//   const roman = {
+//       'I': 1,
+//       'V': 5,
+//       'X': 10,
+//       'L': 50,
+//       'C': 100,
+//       'D': 500,
+//       'M': 1000
+//   };
+
+//   for (let i = 0; i < s.length - 1; i++) {
+//       if (roman[s[i]] < roman[s[i + 1]]) {
+//           res -= roman[s[i]];
+//       } else {
+//           res += roman[s[i]];
+//       }
+//   }
+
+//   return res + roman[s[s.length - 1]];      
+// };
diff --git a/0058-length-of-last-word.js b/0058-length-of-last-word.js
@@ -21,3 +21,18 @@
 var lengthOfLastWord = function(s) {
   return s.trim().split(/\s+/).pop().length;
 };
+
+// var lengthOfLastWord = function(s) {
+//   let end = s.length - 1;
+
+//   while (end >= 0 && s[end] === ' ') {
+//       end--;
+//   }
+
+//   let start = end;
+//   while (start >= 0 && s[start] !== ' ') {
+//       start--;
+//   }
+
+//   return end - start;    
+// };
diff --git a/example/ProgrammingSkills/1.Simulation/0058.js b/example/ProgrammingSkills/1.Simulation/0058.js
@@ -0,0 +1,15 @@
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var lengthOfLastWord = function(s) {
+
+};
+
+const example1 = lengthOfLastWord("Hello World"); // 5
+const example2 = lengthOfLastWord("  fly me   to   the moon  "); // 4
+const example3 = lengthOfLastWord("luffy is still joyboy"); // 6
+
+console.log(example1);
+console.log(example2);
+console.log(example3);
diff --git a/example/ProgrammingSkills/1.Simulation/0709.js b/example/ProgrammingSkills/1.Simulation/0709.js
@@ -0,0 +1,24 @@
+/**
+ * @param {string} s
+ * @return {string}
+ */
+var toLowerCase = function(s) {
+    let result = '';
+    for (let i = 0; i < s.length; i++) {
+        const ascii = s.charCodeAt(i);
+        if (ascii >= 65 && ascii <= 90) {
+            result += String.fromCharCode(ascii + 32);
+        } else {
+            result += s.charAt(i);
+        }
+    }
+    return result;
+};
+
+const example1 = lengthOfLastWord("Hello World"); // 5
+const example2 = lengthOfLastWord("  fly me   to   the moon  "); // 4
+const example3 = lengthOfLastWord("luffy is still joyboy"); // 6
+
+console.log(example1);
+console.log(example2);
+console.log(example3);
diff --git a/example/README.md b/example/README.md
@@ -215,4 +215,9 @@ Better order to solve problems
 389. Find the Difference
 28. Find the Index of the First Occurrence in a String
 459. Repeated Substring Pattern
-66. Plus One
+66. Plus One
+
+### [0.Basic](https://github.com/Barklim/leetcode-javascript/tree/master/example/ProgrammingSkills/1.Simulation)
+
+58. Length of Last Word
+1041. Robot Bounded In Circle
