ATS resume help
前往频道在 Telegram
WhatsApp Me https://wa.me/917674087200 ✅ ATS-Friendly Resumes ✅ Higher Interview Calls ✅ Free Tips + Templates
显示更多3 687
订阅者
-124 小时
-167 天
-8130 天
帖子存档
3 687
int n=books.size();
vector<vector<int>> cost(n+1,vector<int>(n+1));
for(int i=1;i<=n;i++)
{
int height=books[i-1][1];
int width=books[i-1][0];
cost[i][i]=height;
for(int j=i+1;j<=n;j++)
{
height=max(height,books[j-1][1]);
width+=books[j-1][0];
if(width<=shelfWidth) cost[i][j]=height;
else cost[i][j]=-1;
}
}
vector<int> ans(n+1);
ans[0]=0;
for(int i=1;i<=n;i++)
{
ans[i]=INT_MAX;
for(int j=1;j<=i;j++)
{
if(cost[j][i]==-1) continue;
if(ans[j-1]!=INT_MAX) ans[i]=min(ans[i],ans[j-1]+cost[j][i]);
}
}
return ans[n]
Murder on book shelf Code
Telegram ✅ @examsAssistance
3 687
public class LIS{
static int incre_subseq(int my_arr[], int arr_len){
int seq_arr[] = new int[arr_len];
int i, j, max = 0;
for (i = 0; i < arr_len; i++)
seq_arr[i] = 1;
for (i = 1; i < arr_len; i++)
for (j = 0; j < i; j++)
if (my_arr[i] > my_arr[j] && seq_arr[i] < seq_arr[j] + 1)
seq_arr[i] = seq_arr[j] + 1;
for (i = 0; i < arr_len; i++)
if (max < seq_arr[i])
max = seq_arr[i];
return max;
}
public static void main(String args[]){
int my_arr[] = { 10, 22, 9, 33, 21, 50, 41, 60 };
int arr_len = my_arr.length;
System.out.println("The length of the longest increasing subsequence is " + incre_subseq(my_arr, arr_len));
}
}
Sub sequence arrangementn✅
Telegram ✅ @examsAssistance
3 687
def isPalindrome(s):
return s == s[::-1]
# Driver code
s = "malayalam"
ans = isPalindrome(s)
if ans:
print("Yes")
else:
print("No")
Python
Palindrome Code
Telegram - @examsAssistance
