-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.html
More file actions
53 lines (53 loc) · 1.82 KB
/
index.html
File metadata and controls
53 lines (53 loc) · 1.82 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<title>Unqiue paths</title>
<link rel="stylesheet" href="styles.css" />
<script src="app.js" defer type="module"></script>
</head>
<body>
<header>
<ul>
<li>
<h3>Row:</h3>
<input type="number" id="row-input" class="boxes" max="12" min="1" required value="2" />
</li>
<li>
<h3>Column:</h3>
<input type="number" id="col-input" class="boxes" max="12" min="1" required value="2" />
</li>
<li>
<h3 id="enter-button">Enter</h3>
</li>
</ul>
</header>
<main>
<ul></ul>
</main>
<footer>
<h1 id="simulate-button">Simulate</h1>
<div id="path-counter">
<h3>Path discovered:</h3>
<input type="text" class="boxes" readonly value="0" />
</div>
</footer>
<section id="disclaimer">
<h3>
The program above is a simulation of the problem
<a target="_blank" href="https://leetcode.com/problems/unique-paths-ii/"
>leetcode/unique-paths-II</a
>. The green block represents the robot that will travel in a red-trailed path.
</h3>
<h3>
The grid has selectable obstacles, it dodges these obstacles to find its destination. It follows a
recursive path and backtracks to find a unique path.
</h3>
<h3 id="note">
Note: The program uses recursion and backtracking for visual purposes only, the actual problem can
be solved using Dynamic programming.
</h3>
</section>
</body>
</html>