From f8748fcbdfd4fb57fc7c0102668106b1b3fc2524 Mon Sep 17 00:00:00 2001
From: Sami <i.l.y.e.s@live.fr>
Date: Tue, 12 Nov 2024 12:36:29 -0500
Subject: [PATCH] fix: numbersofAs

---
 InfinitString/InfinityString.class | Bin 0 -> 1302 bytes
 InfinitString/InfinityString.java  | 117 +++++++++++++++++++++++++++++
 2 files changed, 117 insertions(+)
 create mode 100644 InfinitString/InfinityString.class
 create mode 100644 InfinitString/InfinityString.java

diff --git a/InfinitString/InfinityString.class b/InfinitString/InfinityString.class
new file mode 100644
index 0000000000000000000000000000000000000000..9072325bf31af2ba414a8571abe304e01b1db978
GIT binary patch
literal 1302
zcmZux-Ez}L6#h1rEyod%5S%6?rpsSrJ1(YeoEDO}7*kr61ekFrGYquTjkCl`rIklo
zmHM9N=yZD1o8FWQ!?ZIz058&4=oN5QPA17TH`-n8Ip_O1M|$)2@7Dm@xL?2+GBzv+
zS>zZd_r%Yl?hCbBf3UqLyP6@l<|$7%88YR{mW@2aR2r0M&#!m7LMa)Iqkst;j)PM;
zeXL4n5NjDQjCqQoxRGXhVck{zM0a!~MX*|cjY)$)#V}hwF{H9(5T+fRLy?Gt3Gq5C
z_Av6)L9skOU}!(|rHCb$O3R23!X)C01m>yTMc$K<<U;LmPxBy&HSdN>3s1#d_ayhF
zHYu%}yns2Jw=wTv0VRg%1LjA-80@}*_KmcC;;D5btkuevk@lejj*AR=C4bQyo{|jb
z%9WAKqtSU>W@sE^-V2}cK&S!NULa#5gg+BXa~<+X_NAa*PiVu{##IL&VUZ{q7*~-&
z)GxPy3aU1i9MteJ!)aGNHQgMH7#dPZ5I=a@iWz23P~e&hbEq2=t}|F=cckf42cMa7
z$#(rPmIXAhV&iiMUl;~QX6OJW=S#J#dxp(T2dh{kp4~7}+5n$u9pN_6bnqo^F^tE_
zcAWOl&~)7s+%w^~9h&Gn3==wR_e9i+A~7(eE05c>w8I^;{*39s{Uq3y(RX6or#DtW
z-8Xd~|Gy`dErwGaExJE#ihdez;~ovODOl*xTy^DL&lH(HZtOKPEx1T>$LKQyERa{o
z(eo=hm1t$OW~(p3{-O=TU3!{p;0DI=HNK&}3H6YnWT5d6>_;y!{*nZ|z}d4iL(DD>
zabeROE{zUXnslg@UZFh1HM;!du=FM5sYnwO<mWVQVHPbK%G<a~hF!-UEE8D4jL1Ih
z9)V^lqn25puMV;7H`ArRVpU(^Mya=6w0_0pLN!yghFGUpKdvwQN%3Q;kP9@9z!N%s
zPhx(+6a*pekZy@8dT{AB5B3&S#>huA5Bs<=<>csgDYHhft<Bo&W@g1ITBYAHS1Ve}
zE7@XpQv8P8bH<)q?2mW<&L6^_Pg8v=5zx#k5*Xq#?JI~<$Qfkb(f=uHqrq%^OVB9(
MM=}{UQtF%U0be{DssI20

literal 0
HcmV?d00001

diff --git a/InfinitString/InfinityString.java b/InfinitString/InfinityString.java
new file mode 100644
index 0000000..3f0e402
--- /dev/null
+++ b/InfinitString/InfinityString.java
@@ -0,0 +1,117 @@
+import java.util.Scanner;
+
+/**
+ * InfinityString
+ * There is a string, , of lowercase English letters that is repeated infinitely
+ * many times. Given an integer, , find and print the number of letter a's in
+ * the first
+ * 
+ * letters of the infinite string.
+ * 
+ * Example
+ * 
+ * The substring we consider is , the first characters of the infinite string.
+ * There are
+ * 
+ * occurrences of a in the substring.
+ * 
+ * Function Description
+ * 
+ * Complete the repeatedString function in the editor below.
+ * 
+ * repeatedString has the following parameter(s):
+ * 
+ * s: a string to repeat
+ * n: the number of characters to consider
+ * 
+ * Returns
+ * 
+ * int: the frequency of a in the substring
+ * 
+ * Input Format
+ * 
+ * The first line contains a single string,
+ * .
+ * The second line contains an integer,
+ * 
+ * .
+ * 
+ * Constraints
+ * 
+ * For of the test cases,
+ * 
+ * .
+ * 
+ * Sample Input
+ * 
+ * Sample Input 0
+ * 
+ * aba
+ * 10
+ * 
+ * Sample Output 0
+ * 
+ * 7
+ * 
+ */
+public class InfinityString {
+
+  public static void main(String[] args) {
+
+    // MY SOLUTION IS SLOW BUT IT WORKS
+    Scanner sc = new Scanner(System.in);
+    System.out.println("Please enter your 'String' here and it must contains the letter A: ");
+    String str = sc.nextLine();
+    System.out.println("Please enter how many times you want to repeat that: ");
+    int x = sc.nextInt();
+    System.out.println(numsOfAs(str, x));
+    sc.close();
+  }
+
+  //
+  // private static int numsOfAs(String str, int n) {
+  // int numberOfAs = 0;
+  // int x = n;
+  // String newSTR = "";
+  // int remeinder = n / str.length();
+  // while (n > 0 && newSTR.toCharArray().length < n + remeinder) {
+  // newSTR += str;
+  // n--;
+  // }
+  //
+  // char[] charNewstr = newSTR.toCharArray();
+  // for (int i = 0; i < x; i++) {
+  // if (charNewstr[i] == 'a') {
+  // numberOfAs++;
+  // }
+  // }
+  // return numberOfAs;
+  //
+  //
+  private static int numsOfAs(String str, int n) {
+    int numberOfAs = 0;
+    int numRepeats = n / str.length();
+    int remainder = n % str.length();
+
+    // Count the number of 'a' characters in the repeated string
+    numberOfAs = countAs(str) * numRepeats;
+
+    // Count the number of 'a' characters in the remaining portion
+    if (remainder > 0) {
+      numberOfAs += countAs(str.substring(0, remainder));
+    }
+
+    return numberOfAs;
+  }
+
+  private static int countAs(String str) {
+    int count = 0;
+    for (char c : str.toCharArray()) {
+      if (c == 'a') {
+        count++;
+      }
+    }
+    return count;
+  }
+
+}