Skip to content

Create javaSolutionReducingDishes.java #247

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create javaSolutionReducingDishes.java #247

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 19 additions & 0 deletions Reducing Dishes/javaSolutionReducingDishes.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
//https://leetcode.com/problems/reducing-dishes/

class Solution {
public int maxSatisfaction(int[] satis) {
Arrays.sort(satis);
int dp[][]=new int[satis.length+1][satis.length+1];
for(int arr[]:dp){
Arrays.fill(arr,-1);
}
return solve(satis,0,1,dp);
}
static int solve(int arr[],int i,int time,int dp[][]){
if(i>=arr.length) return 0;
if(dp[i][time]!=-1) return dp[i][time];
int taken=(arr[i]*time)+solve(arr,i+1,time+1,dp);
int not=solve(arr,i+1,time,dp);
return dp[i][time]=Math.max(0,Math.max(taken,not));
}
}