Add solution #26

Author: JoshCrozier

README.md

@@ -27,6 +27,7 @@
 22|[Generate Parentheses](./0022-generate-parentheses.js)|Medium|
 23|[Merge k Sorted Lists](./0023-merge-k-sorted-lists.js)|Hard|
 24|[Swap Nodes in Pairs](./0024-swap-nodes-in-pairs.js)|Medium|
+26|[Remove Duplicates from Sorted Array](./0026-remove-duplicates-from-sorted-array.js)|Easy|
 27|[Remove Element](./0027-remove-element.js)|Easy|
 28|[Implement strStr()](./0028-implement-strstr.js)|Easy|
 29|[Divide Two Integers](./0029-divide-two-integers.js)|Medium|

solutions/0026-remove-duplicates-from-sorted-array.js

@@ -0,0 +1,34 @@
+/**
+ * 26. Remove Duplicates from Sorted Array
+ * https://leetcode.com/problems/remove-duplicates-from-sorted-array/
+ * Difficulty: Easy
+ *
+ * Given an integer array nums sorted in non-decreasing order, remove the
+ * duplicates in-place such that each unique element appears only once.
+ * The relative order of the elements should be kept the same.
+ *
+ * Since it is impossible to change the length of the array in some languages,
+ * you must instead have the result be placed in the first part of the array
+ * nums. More formally, if there are k elements after removing the duplicates,
+ * then the first k elements of nums should hold the final result. It does not
+ * matter what you leave beyond the first k elements.
+ *
+ * Return k after placing the final result in the first k slots of nums.
+ *
+ * Do not allocate extra space for another array. You must do this by modifying
+ * the input array in-place with O(1) extra memory.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var removeDuplicates = function(nums) {
+  let i = 0;
+  for (let j = 0; j < nums.length; j++) {
+    if (nums[i] !== nums[j]) {
+      nums[++i] = nums[j];
+    }
+  }
+  return ++i;
+};