Leetcode 1531 String Compression II

Solution to leetcode problem 1531. String Compression II

I have used Dynamic Programming DP to solve this problem.

Telegram Links:

[tejaswinigondane]

in 10:19 why to take a2 for a7 and for a10 to a3 I did'nt understand this

[kentnar]

This is my java solution: Logically It makes sense to me but I am having trouble with the testcases, any pointers will help:
class Solution {
public int s, int k) {
int[][] x = new int[s.length() + 1][k + 1];
for(int[] j : x){
Arrays.fill(j, -1);
}
return find(s, k, 0, x, Character.MIN_VALUE, 0);
}
int find(String s, int k, int index, int[][] x, char cur, int charcount){
if(k == 0 || index >= s.length()){
return Calculate_len(s, index);
}
if(x[index][k] != -1){
return x[index][k];
}
int count = 0;
if(cur != s.charAt(index)){
String num = String.valueOf(charcount);
int val = 0;
if(num.equals("1")){
val = 1;
}
else if(num.equals("0")){
val = 0;
}
else{
val = num.length() + 1;
}
// System.out.println(num + " " + val);
count = Math.min(find(s, k, index + 1, x, s.charAt(index), 1) + val, find(s, k - 1, index + 1, x, cur, charcount));
}
else{
count = Math.min(find(s, k, index + 1, x, s.charAt(index), charcount + 1), find(s, k - 1, index + 1, x, cur, charcount));
}
x[index][k] = count;
// + " " + index + " " + k);
return x[index][k];
}
int Calculate_len(String s, int index){
if(index >= s.length()){
return 0;
}
String ns = s.substring(index);
int i = 0;
int fin_count = 0;
while(i < ns.length()){
int count = 1;
while(i < ns.length() - 1 && ns.charAt(i) == ns.charAt(i + 1)){
count++;
i++;
}
if(count == 1){
fin_count++;
}
else{
String num = String.valueOf(count);
fin_count += (num.length() + 1);
}
i++;
}
return fin_count;
}
}

[RohanKumar-sq]

class Solution {
public:
int dp[102][102];
int find(int n){
if(n==1) return 1;
if(n>1 and n<10) return 2;
if(n>=10 and n<100) return 3;
return 4;
}
int solve(string &s, int k, int idx){
if(k<0)
return s.size();
if(idx>=s.size() || (s.size()-idx)<=k)
return 0;
if(dp[idx][k]!=-1)
return dp[idx][k];
int ans=s.size();
ans=solve(s, k-1, idx+1);
int cons=0, cnt=0, j;
for( j=idx;j<s.size() && cnt<=k;j++){
if(s[j]==s[idx])
cons++;
else{
ans=min(ans, find(cons)+solve(s, k-cnt, j));
cnt++;
}
}
if(cnt<=k)
ans=min(ans, find(cons)+solve(s, k-cnt, j));
return dp[idx][k]=ans;
}
int s, int k) {
memset(dp, -1, size(dp));
return solve(s, k, 0);
}
};

what is the error in my code