7 538
Подписчики
-424 часа
-377 дней
-15030 день
Архив постов
import java.util.Scanner;
public class TestClass {
public static void Occurance(String st){
String output = "";
char currentChar = st.charAt(0);
int count = 1;
for (int i = 1; i < st.length(); i++) {
if (st.charAt(i) == currentChar) {
count++;
} else {
output += currentChar + Integer.toString(count);
currentChar = st.charAt(i);
count = 1;
}
}
output += currentChar + Integer.toString(count);
System.out.println(output);
}
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String st;
st=sc.nextLine();
Occurance(st);
}
}
Deloitte 7pm solutions group :
https://t.me/cod_solutions
Deloitte 7pm done successfully 🔥🔥🔥
100% clearance for any exam .
Just contact 👉👉👉 @mlcoder2
Note : Remote access available
// Infosys
//Given Array A having N integers and divisor K
int morethanNbyK(vector arr, int n, int k)
{
int x = n / k;
int ans = 0;
unordered_map freq;
for (auto i : arr)
freq[i]++;
for (auto i : freq)
{
if (i.second > x)
{
ans += i.first;
}
}
return ans;
}
C++✅
// Infosys
// N flowers on a Recatangular pana
int ans = 100000000;
void solve(vector<int> a, int n, int k, int index, int sum,
int maxsum)
{
if (k == 1)
{
maxsum = max(maxsum, sum);
sum = 0;
for (int i = index; i < n; i++)
{
sum += a[i];
}
maxsum = max(maxsum, sum);
ans = min(ans, maxsum);
return;
}
sum = 0;
for (int i = index; i < n; i++)
{
sum += a[i];
maxsum = max(maxsum, sum);
solve(a, n, k - 1, i + 1, sum, maxsum);
}
}
int GetMaxBeauty(int N, int K, vector<int> A)
{
solve(A, N, K, 0, 0, 0);
return ans;
}
infosys-SP-DSP C++✅
Those who need help for Infosys 3pm . They can contact us immediately.
100% clearance
👉👉@mlcoder2
Remote access Available.
