Added tasks 1784, 1785.

Author: ThanhNIT

src/main/java/g1701_1800/s1784_check_if_binary_string_has_at_most_one_segment_of_ones/Solution.java

@@ -0,0 +1,21 @@
+package g1701_1800.s1784_check_if_binary_string_has_at_most_one_segment_of_ones;
+
+// #Easy #String #2022_04_30_Time_1_ms_(65.60%)_Space_42.6_MB_(11.20%)
+
+public class Solution {
+    public boolean checkOnesSegment(String s) {
+        boolean metOne = false;
+        for (int i = 0; i < s.length(); i++) {
+            if (s.charAt(i) == '1' && metOne) {
+                return false;
+            }
+            if (s.charAt(i) == '1') {
+                metOne = true;
+                while (i < s.length() && s.charAt(i) == '1') {
+                    i++;
+                }
+            }
+        }
+        return true;
+    }
+}

src/main/java/g1701_1800/s1784_check_if_binary_string_has_at_most_one_segment_of_ones/readme.md

@@ -0,0 +1,25 @@
+1784\. Check if Binary String Has at Most One Segment of Ones
+
+Easy
+
+Given a binary string `s` **without leading zeros**, return `true` _if_ `s` _contains **at most one contiguous segment of ones**_. Otherwise, return `false`.
+
+**Example 1:**
+
+**Input:** s = "1001"
+
+**Output:** false
+
+**Explanation:** The ones do not form a contiguous segment.
+
+**Example 2:**
+
+**Input:** s = "110"
+
+**Output:** true
+
+**Constraints:**
+
+*   `1 <= s.length <= 100`
+*   `s[i]` is either `'0'` or `'1'`.
+*   `s[0]` is `'1'`.

src/main/java/g1701_1800/s1785_minimum_elements_to_add_to_form_a_given_sum/Solution.java

@@ -0,0 +1,14 @@
+package g1701_1800.s1785_minimum_elements_to_add_to_form_a_given_sum;
+
+// #Medium #Array #Greedy #2022_04_30_Time_2_ms_(70.75%)_Space_82.5_MB_(57.55%)
+
+public class Solution {
+    public int minElements(int[] nums, int limit, int goal) {
+        long sum = 0;
+        for (int num : nums) {
+            sum += num;
+        }
+        long diff = Math.abs(goal - sum);
+        return diff % limit == 0 ? (int) (diff / limit) : (int) ((diff / limit) + 1);
+    }
+}

src/main/java/g1701_1800/s1785_minimum_elements_to_add_to_form_a_given_sum/readme.md

@@ -0,0 +1,25 @@
+1784\. Check if Binary String Has at Most One Segment of Ones
+
+Easy
+
+Given a binary string `s` **without leading zeros**, return `true` _if_ `s` _contains **at most one contiguous segment of ones**_. Otherwise, return `false`.
+
+**Example 1:**
+
+**Input:** s = "1001"
+
+**Output:** false
+
+**Explanation:** The ones do not form a contiguous segment.
+
+**Example 2:**
+
+**Input:** s = "110"
+
+**Output:** true
+
+**Constraints:**
+
+*   `1 <= s.length <= 100`
+*   `s[i]` is either `'0'` or `'1'`.
+*   `s[0]` is `'1'`.

src/test/java/g1701_1800/s1784_check_if_binary_string_has_at_most_one_segment_of_ones/SolutionTest.java

@@ -0,0 +1,18 @@
+package g1701_1800.s1784_check_if_binary_string_has_at_most_one_segment_of_ones;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import org.junit.jupiter.api.Test;
+
+class SolutionTest {
+    @Test
+    void checkOnesSegment() {
+        assertThat(new Solution().checkOnesSegment("1001"), equalTo(false));
+    }
+
+    @Test
+    void checkOnesSegment2() {
+        assertThat(new Solution().checkOnesSegment("110"), equalTo(true));
+    }
+}

src/test/java/g1701_1800/s1785_minimum_elements_to_add_to_form_a_given_sum/SolutionTest.java

@@ -0,0 +1,18 @@
+package g1701_1800.s1785_minimum_elements_to_add_to_form_a_given_sum;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import org.junit.jupiter.api.Test;
+
+class SolutionTest {
+    @Test
+    void minElements() {
+        assertThat(new Solution().minElements(new int[] {1, -1, 1}, 3, -4), equalTo(2));
+    }
+
+    @Test
+    void minElements2() {
+        assertThat(new Solution().minElements(new int[] {1, -10, 9, 1}, 100, 0), equalTo(1));
+    }
+}