Texte vergleichen

Finden Sie den Unterschied zwischen zwei Textdateien

Echtzeit-Diff

Einheitlicher Diff

Zeilen einklappen

Änderungen hervorheben

Syntaxhervorhebung

Werkzeuge

Diffchecker Desktop The most secure way to run Diffchecker. Get the Diffchecker Desktop app: your diffs never leave your computer!Get Desktop

Untitled diff

Created 10 years agoDiff never expires

Zeilen
Gesamt
Entfernt

Wörter
Gesamt
Entfernt

Um diese Funktion weiterhin zu nutzen, aktualisieren Sie auf Diffchecker Pro Preise anzeigen

47 Zeilen

Zeilen
Gesamt
Hinzugefügt

Wörter
Gesamt
Hinzugefügt

Um diese Funktion weiterhin zu nutzen, aktualisieren Sie auf Diffchecker Pro Preise anzeigen

55 Zeilen

DP_TABLE_ENTRY CC(int amt,unsigned int denom_count)

DP_TABLE_ENTRY DP_CC(int amt,unsigned int denom_count)

{

unsigned int n = denom_count;

DP_TABLE_ENTRY ret = {0};

/* Calls with a negative amount are not stored.

* Just need to return count= 0.

if(amt <0)

{

ret.runtime = 1; /* constant runtime */

ret.count = 0;

}

/* Precomputed value, just need to update number of references

* to this value.

else if(DP_TABLE[amt][n].references != 0)

{

DP_TABLE[amt][n].references++;

DP_TABLE[amt][n].runtime = 1; /* constant runtime. */

return DP_TABLE[amt][n];

}

else if(n==0)

{

DP_TABLE[amt][n].count = 0;

DP_TABLE[amt][n].references++;

DP_TABLE[amt][n].runtime = 1; /* constant runtime. */

ret = DP_TABLE[amt][n];

}

else if(amt == 0 )

{

DP_TABLE[amt][n].count = 1;

DP_TABLE[amt][n].references++;

DP_TABLE[amt][n].runtime = 1; /* constant runtime. */

ret = DP_TABLE[amt][n];

}

else

{

DP_TABLE_ENTRY left,right = {0};

int new_amt = amt- maxDenom(n);

int new_n = n-1;

left = CC(amt,new_n);

left = DP_CC(amt,new_n);

right = CC(new_amt,n);

right = DP_CC(new_amt,n);

DP_TABLE[amt][n].count = left.count + right.count;

DP_TABLE[amt][n].references++;

DP_TABLE[amt][n].runtime=left.runtime + right.runtime + 1; /* Runtime of sub-problems + time to conbine their results. */

ret = DP_TABLE[amt][n];

}

return ret;

}

Gespeicherte Diffs

Originaltext

Datei öffnen

DP_TABLE_ENTRY  CC(int amt,unsigned int denom_count)
{
	unsigned int n = denom_count;
	DP_TABLE_ENTRY ret = {0};
	
	/* Calls with a negative amount are not stored.
         * Just need to return count= 0.
         */    
	if(amt <0) 
	{
		ret.runtime = 1; /* constant runtime */
		ret.count = 0;
	}

else if(n==0) 
	{
		DP_TABLE[amt][n].count = 0;
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime = 1; /* constant runtime. */
		ret = DP_TABLE[amt][n];
	}
	else if(amt == 0 ) 
	{
		DP_TABLE[amt][n].count = 1;
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime = 1; /* constant runtime. */
		ret = DP_TABLE[amt][n];
	}

else
	{
		DP_TABLE_ENTRY left,right = {0};
		int new_amt = amt- maxDenom(n);
		int 	     new_n   = n-1;

left = 	CC(amt,new_n);
		right = CC(new_amt,n);
		DP_TABLE[amt][n].count = left.count + right.count; 
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime=left.runtime + right.runtime + 1; /* Runtime of sub-problems + time to conbine their results. */
		
		ret = DP_TABLE[amt][n];
	}

return ret;
}

Geänderter Text

Datei öffnen

DP_TABLE_ENTRY  DP_CC(int amt,unsigned int denom_count)
{
	unsigned int n = denom_count;
	DP_TABLE_ENTRY ret = {0};
	
	/* Calls with a negative amount are not stored.
         * Just need to return count= 0.
         */    
	if(amt <0) 
	{
		ret.runtime = 1; /* constant runtime */
		ret.count = 0;
	}

/* Precomputed value, just need to update number of references
         * to this value.
         */  
	else if(DP_TABLE[amt][n].references != 0) 
	{
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime = 1; /* constant runtime. */
		return DP_TABLE[amt][n];
	}
	else if(n==0) 
	{
		DP_TABLE[amt][n].count = 0;
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime = 1; /* constant runtime. */
		ret = DP_TABLE[amt][n];
	}
	else if(amt == 0 ) 
	{
		DP_TABLE[amt][n].count = 1;
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime = 1; /* constant runtime. */
		ret = DP_TABLE[amt][n];
	}

else
	{
		DP_TABLE_ENTRY left,right = {0};
		int new_amt = amt- maxDenom(n);
		int 	     new_n   = n-1;

left = 	DP_CC(amt,new_n);
		right = DP_CC(new_amt,n);
		DP_TABLE[amt][n].count = left.count + right.count; 
		DP_TABLE[amt][n].references++;
		DP_TABLE[amt][n].runtime=left.runtime + right.runtime + 1; /* Runtime of sub-problems + time to conbine their results. */
		
		ret = DP_TABLE[amt][n];
	}

return ret;
}