algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-12-19 07:00:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

56
src/main/java/com/thealgorithms/dynamicprogramming/UniquePaths.java
View File

@@ -2,7 +2,6 @@
* Github : https://github.com/siddhant2002
*/
/**
* A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
* The robot can only move either down or right at any point in time.
@@ -17,51 +16,46 @@ package com.thealgorithms.dynamicprogramming;
import java.util.*;
public class UniquePaths {
public static boolean uniquePaths(int m , int n , int ans) {
int []dp = new int[n];
Arrays.fill(dp,1);
for (int i=1; i<m; i++)
{
for (int j=1; j<n; j++)
{
dp[j] += dp[j-1];
public static boolean uniquePaths(int m, int n, int ans) {
int[] dp = new int[n];
Arrays.fill(dp, 1);
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
dp[j] += dp[j - 1];
}
}
return dp[n-1]==ans;
return dp[n - 1] == ans;
// return true if predicted answer matches with expected answer
}
// The above method runs in O(n) time
public static boolean uniquePaths2(int m , int n , int ans) {
public static boolean uniquePaths2(int m, int n, int ans) {
int dp[][] = new int[m][n];
for (int i=0; i<m; i++)
{
for (int i = 0; i < m; i++) {
dp[i][0] = 1;
}
for (int j=0; j<n; j++)
{
for (int j = 0; j < n; j++) {
dp[0][j] = 1;
}
for (int i=1; i<m; i++)
{
for (int j=1; j<n; j++)
{
dp[i][j]=dp[i-1][j]+dp[i][j-1];
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp[m-1][n-1]==ans;
return dp[m - 1][n - 1] == ans;
// return true if predicted answer matches with expected answer
}
// The above mthod takes O(m*n) time
}
/**
* OUTPUT :
* Input - m = 3, n = 7
* Output: it returns either true if expected answer matches with the predicted answer else it returns false
* 1st approach Time Complexity : O(n)
* Auxiliary Space Complexity : O(n)
* Input - m = 3, n = 7
* Output: it returns either true if expected answer matches with the predicted answer else it returns false
* 2nd approach Time Complexity : O(m*n)
* Auxiliary Space Complexity : O(m*n)
*/
* OUTPUT :
* Input - m = 3, n = 7
* Output: it returns either true if expected answer matches with the predicted answer else it returns false
* 1st approach Time Complexity : O(n)
* Auxiliary Space Complexity : O(n)
* Input - m = 3, n = 7
* Output: it returns either true if expected answer matches with the predicted answer else it returns false
* 2nd approach Time Complexity : O(m*n)
* Auxiliary Space Complexity : O(m*n)
*/