Add solution #434

Author: JoshCrozier

README.md

@@ -252,6 +252,7 @@
 414|[Third Maximum Number](./0414-third-maximum-number.js)|Easy|
 415|[Add Strings](./0415-add-strings.js)|Easy|
 419|[Battleships in a Board](./0419-battleships-in-a-board.js)|Medium|
+434|[Number of Segments in a String](./0434-number-of-segments-in-a-string.js)|Easy|
 435|[Non-overlapping Intervals](./0435-non-overlapping-intervals.js)|Medium|
 437|[Path Sum III](./0437-path-sum-iii.js)|Medium|
 442|[Find All Duplicates in an Array](./0442-find-all-duplicates-in-an-array.js)|Medium|

solutions/0434-number-of-segments-in-a-string.js

@@ -0,0 +1,17 @@
+/**
+ * 434. Number of Segments in a String
+ * https://leetcode.com/problems/number-of-segments-in-a-string/
+ * Difficulty: Easy
+ *
+ * Given a string s, return the number of segments in the string.
+ *
+ * A segment is defined to be a contiguous sequence of non-space characters.
+ */
+
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var countSegments = function(s) {
+  return s.split(/\s+/).filter(s => s).length;
+};