Uh oh!
There was an error while loading.Please reload this page.
- Notifications
You must be signed in to change notification settings - Fork312
Leetcode_Problems#8
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.
By clicking “Sign up for GitHub”, you agree to ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
Open
Rajeshjha586 wants to merge2 commits intorampatra:masterChoose a base branch
base:master
Could not load branches
Branch not found:{{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline, and old review comments may become outdated.
Uh oh!
There was an error while loading.Please reload this page.
Open
Changes fromall commits
Commits
Show all changes
2 commits Select commitHold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Uh oh!
There was an error while loading.Please reload this page.
Jump to
Jump to file
Failed to load files.
Loading
Uh oh!
There was an error while loading.Please reload this page.
Diff view
Diff view
There are no files selected for viewing
60 changes: 60 additions & 0 deletions...in/java/com/leetcode/dynamicprogramming/Leetcode_516_Longest_Palindromic_SubSequence.java
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,60 @@ | ||
| public static void display_1D(int[] arr) | ||
| { | ||
| for (int ele : arr) | ||
| { | ||
| System.out.print(ele + "\t"); | ||
| } | ||
| System.out.println(); | ||
| } | ||
| public static void display_2D(int[][] arr) | ||
| { | ||
| for (int[] ar : arr) | ||
| { | ||
| display_1D(ar); | ||
| } | ||
| System.out.println(); | ||
| } | ||
| public static int Leetcode_516_Longest_Pallindromic_SubSequence_Tabulation(String str, int si, int ei, int[][] dp, boolean[][] isPalindrome) | ||
| { | ||
| int n=str.length(); | ||
| for(int gap = 0; gap < n; gap++) | ||
| { | ||
| for(si = 0; si < n - gap; si++) | ||
| { | ||
| ei = si + gap; | ||
| if(isPalindrome[si][ei]) | ||
| { | ||
| dp[si][ei] = ei-si+1; | ||
| continue; | ||
| } | ||
| int len=0; | ||
| if(str.charAt(si) == str.charAt(ei)) | ||
| { | ||
| len = dp[si+1][ei-1] + 2; | ||
| } | ||
| else | ||
| { | ||
| len = Math.max(dp[si+1][ei], dp[si][ei-1]); | ||
| } | ||
| dp[si][ei] = len; | ||
| } | ||
| } | ||
| return dp[0][str.length()-1]; | ||
| } | ||
| public static void Leetcode_516_Longest_Pallindromic_SubSequence() | ||
| { | ||
| String str = "geeksforgeeks"; | ||
| int n = str.length(); | ||
| int si = 0, ei = n - 1; | ||
| int[][] dp = new int[n][n]; | ||
| boolean[][] isPalindrome = is_Pallindrome_SubString(str); | ||
| System.out.println("Tabulation :- " + Leetcode_516_Longest_Pallindromic_SubSequence_Tabulation(str, si, ei, dp, isPalindrome)); | ||
| display_2D(dp); | ||
| } |
60 changes: 60 additions & 0 deletionssrc/main/java/com/leetcode/dynamicprogramming/Leetcode_70_Climb_Stairs.java
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,60 @@ | ||
| public static int LeetCode_70_Climbing_Stairs_Memoization(int n, int[] dp) | ||
| { | ||
| if (n <= 1) | ||
| { | ||
| return dp[n] = 1; | ||
| } | ||
| if (dp[n] != 0) | ||
| { | ||
| return dp[n]; | ||
| } | ||
| int ans = LeetCode_70_Climbing_Stairs_Memoization(n - 1, dp) | ||
| + LeetCode_70_Climbing_Stairs_Memoization(n - 2, dp); | ||
| return dp[n] = ans; | ||
| } | ||
| public static int LeetCode_70_Climbing_Stairs_Tabulation(int n, int[] dp) | ||
| { | ||
| int N = n; | ||
| for (n = 0; n <= N; n++) | ||
| { | ||
| if (n <= 1) | ||
| { | ||
| dp[n] = 1; | ||
| continue; | ||
| } | ||
| int ans = dp[n - 1] + dp[n - 2]; | ||
| dp[n] = ans; | ||
| } | ||
| return dp[N]; | ||
| } | ||
| public static int LeetCode_70_Climbing_Stairs_Better(int n) | ||
| { | ||
| int a = 1; | ||
| int b = 1; | ||
| int sum = 0; | ||
| for (int i = 2; i <= n; i++) | ||
| { | ||
| sum = a + b; | ||
| a = b; | ||
| b = sum; | ||
| } | ||
| return sum; | ||
| } | ||
| public static void LeetCode_70_Climbing_Stairs() | ||
| { | ||
| int n=7; | ||
| int[] dp = new int[n+1]; | ||
| System.out.println("Memoization :- " + LeetCode_70_Climbing_Stairs_Memoization(n, dp)); | ||
| display_1D(dp); | ||
| System.out.println("Tabulation :- " + LeetCode_70_Climbing_Stairs_Tabulation(n, dp)); | ||
| display_1D(dp); | ||
| System.out.println("Better :- " + LeetCode_70_Climbing_Stairs_Better(n)); | ||
| } |
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.