Create 0045.js

Barklim · Barklim · commit 3237c5ea65ee · 2025-03-17T01:11:32.000+03:00
diff --git a/example/3.Linkedlist/0445.js b/example/3.Linkedlist/0445.js
@@ -0,0 +1,56 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} l1
+ * @param {ListNode} l2
+ * @return {ListNode}
+ */
+var addTwoNumbers = function(l1, l2) {
+
+};
+
+const myLinkedList = new LinkedList();
+myLinkedList.prepend(7);
+myLinkedList.append(2);
+myLinkedList.append(4);
+myLinkedList.append(3);
+
+const myLinkedList2 = new LinkedList();
+myLinkedList2.prepend(5);
+myLinkedList2.append(6);
+myLinkedList2.append(4);
+
+const myLinkedList3 = new LinkedList();
+myLinkedList3.prepend(0);
+
+const myLinkedList4 = new LinkedList();
+myLinkedList4.prepend(0);
+
+const myLinkedList5 = new LinkedList();
+myLinkedList5.prepend(1);
+myLinkedList5.append(2);
+myLinkedList5.append(3);
+
+const myLinkedList6 = new LinkedList();
+myLinkedList6.prepend(4);
+myLinkedList6.append(5);
+myLinkedList6.append(6);
+
+const executeList = (l1, l2) => addTwoNumbers(l1.head, l2.head)
+
+const execute = (l1, l2) => {
+    console.log('travers')
+    console.log(l1.toString());
+    console.log(l2.toString());
+    const list1 = executeList(l1, l2)
+    console.log(traversList(list1))
+}
+
+execute(myLinkedList, myLinkedList2) // [7,2,4,3] [5,6,4] // [7,8,0,7]
+execute(myLinkedList3, myLinkedList4) // [0] [0] // [0] ???
+execute(myLinkedList5, myLinkedList6) // [1,2,3] [4,5,6] // [5,7,9]
diff --git a/example/5.Stack/0071.js b/example/5.Stack/0071.js
@@ -6,11 +6,11 @@ var simplifyPath = function(path) {
 
 };
 
-const example1 = isValid("/home/"); // "/home"
-const example2 = isValid("/home//foo/"); // "/home/foo"
-const example3 = isValid("/home/user/Documents/../Pictures"); // "/home/user/Pictures"
-const example4 = isValid("/../"); // "/"
-const example5 = isValid("/.../a/../b/c/../d/./"); // "/.../b/d"
+const example1 = simplifyPath("/home/"); // "/home"
+const example2 = simplifyPath("/home//foo/"); // "/home/foo"
+const example3 = simplifyPath("/home/user/Documents/../Pictures"); // "/home/user/Pictures"
+const example4 = simplifyPath("/../"); // "/"
+const example5 = simplifyPath("/.../a/../b/c/../d/./"); // "/.../b/d"
 
 console.log(example1);
 console.log(example2);
diff --git a/example/README.md b/example/README.md
@@ -47,7 +47,7 @@ Better order to solve problems
 - 76. Minimum Window Substring
 - 239. Sliding Window Maximum
 
-### [Linked list](https://github.com/Barklim/leetcode-javascript/tree/master/example/3.Linkedlist)
+### [3.Linked list](https://github.com/Barklim/leetcode-javascript/tree/master/example/3.Linkedlist)
 
 707. Design Linked List
 876. Middle of the Linked List
@@ -66,8 +66,10 @@ Better order to solve problems
 287. Find the Duplicate Number
 - 23. Merge k Sorted Lists
 - 25. Reverse Nodes in k-Group
+1. 
+445. Add Two Numbers II
 
-### [Binary Search](https://github.com/Barklim/leetcode-javascript/tree/master/example/4.BinarySearch)
+### [4.Binary Search](https://github.com/Barklim/leetcode-javascript/tree/master/example/4.BinarySearch)
 
 704. Binary Search
 - 74. Search a 2D Matrix
@@ -237,6 +239,11 @@ Better order to solve problems
 64. Minimum path sum
 72. Edit Distance 
 
+### Greedy
+### Advanced Graphs
+### Bit Manipulation
+### Math & Geometry
+
 ## Programming skills
 
 ### [0.Basic](https://github.com/Barklim/leetcode-javascript/tree/master/example/ProgrammingSkills/0.Basic)
