From a4a5c909234335cbf64764b067d3d0f23829f8fc Mon Sep 17 00:00:00 2001
From: Andrew Shitov <mail@andreyshitov.com>
Date: Mon, 1 Apr 2024 16:12:40 +0200
Subject: Week 263 Task 1 by ash

---
 challenge-263/ash/java/ch-1.java | 42 ++++++++++++++++++++++++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 challenge-263/ash/java/ch-1.java

(limited to 'challenge-263/ash/java/ch-1.java')

diff --git a/challenge-263/ash/java/ch-1.java b/challenge-263/ash/java/ch-1.java
new file mode 100644
index 0000000000..fe856b3e07
--- /dev/null
+++ b/challenge-263/ash/java/ch-1.java
@@ -0,0 +1,42 @@
+// Solution of Task 1 of The Weekly Challenge 263
+// https://theweeklychallenge.org/blog/perl-weekly-challenge-263/
+
+/*
+$ java ch-1.java
+[1, 2]
+[]
+[4]
+*/
+
+import java.util.Arrays;
+import java.util.ArrayList;
+
+public class Main {
+    public static void main(String[] args) {
+        int[][] tests = {{1, 5, 3, 2, 4, 2},
+                        {1, 2, 4, 3, 5},
+                        {5, 3, 2, 4, 2, 1}};
+        int[] values = {2, 6, 4};
+
+        for (int c = 0; c != tests.length; c++) {
+            int[] data = tests[c];
+            int value = values[c];
+
+            ArrayList<Integer> indices = solve(data, value);
+            System.out.println(indices);
+        }
+    }
+
+    static ArrayList<Integer> solve(int[] data, int value) {
+        Arrays.sort(data);
+
+        ArrayList<Integer> indices = new ArrayList<Integer>();
+        for (int c = 0; c != data.length; c++) {
+            int current = data[c];
+            if (current == value) indices.add(c);
+            if (current > value) break;
+        }
+
+        return indices;
+    }
+}
-- 
cgit