Add solution #198

Author: JoshCrozier

README.md

@@ -86,6 +86,7 @@
 189|[Rotate Array](./0189-rotate-array.js)|Medium|
 190|[Reverse Bits](./0190-reverse-bits.js)|Easy|
 191|[Number of 1 Bits](./0191-number-of-1-bits.js)|Easy|
+198|[House Robber](./0198-house-robber.js)|Medium|
 203|[Remove Linked List Elements](./0203-remove-linked-list-elements.js)|Easy|
 206|[Reverse Linked List](./0206-reverse-linked-list.js)|Easy|
 214|[Shortest Palindrome](./0214-shortest-palindrome.js)|Hard|

solutions/0198-house-robber.js

@@ -0,0 +1,30 @@
+/**
+ * 198. House Robber
+ * https://leetcode.com/problems/house-robber/
+ * Difficulty: Medium
+ *
+ * You are a professional robber planning to rob houses along a street. Each house has a certain
+ * amount of money stashed, the only constraint stopping you from robbing each of them is that
+ * adjacent houses have security systems connected and it will automatically contact the police
+ * if two adjacent houses were broken into on the same night.
+ *
+ * Given an integer array nums representing the amount of money of each house, return the maximum
+ * amount of money you can rob tonight without alerting the police.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var rob = function(nums) {
+  let previous = 0;
+  let current = 0;
+
+  for (const n of nums) {
+    const temp = previous;
+    previous = current;
+    current = Math.max(temp + n, previous);
+  }
+
+  return Math.max(current, previous);
+};