Skip to content
Home
Post Code
Jass (Warcraft III)
Wurst
GUI (Warcraft III)
Galaxy (StarCraft II)
GUI (StarCraft II)
C++
Java
Delphi
Text
Search Code
Compare Code
Uploads
Draw
Create New Drawing
View Drawings
Graph
Log in
<pre class="jasscode">a_deleteDuplicates<span class="style_symbol">(</span> A<span class="style_symbol">[</span> <span class="style_int">0</span>...n <span class="style_symbol">-</span> <span class="style_int">1</span> <span class="style_symbol">]</span> <span class="style_symbol">)</span> :A'<span class="style_symbol">[</span> <span class="style_int">0</span>...n <span class="style_symbol">-</span> <span class="style_int">1</span> <span class="style_symbol">]</span> <span class="style_symbol">{</span> buildHeap<span class="style_symbol">(</span> A <span class="style_symbol">)</span> <span class="style_comment">// as it's done in heapsort</span> <span class="style_keyword">for</span><span class="style_symbol">(</span> i <span class="style_symbol">=</span> n downto <span class="style_int">2</span> <span class="style_symbol">)</span> do <span class="style_symbol">{</span> temp : <span class="style_symbol">=</span> Heap.deleteMin <span class="style_symbol">}</span> <span class="style_keyword">if</span><span class="style_symbol">(</span> A'<span class="style_symbol">[</span> i <span class="style_symbol">-</span> <span class="style_int">1</span> <span class="style_symbol">]</span> <span class="style_symbol">!</span><span class="style_symbol">=</span> temp <span class="style_symbol">)</span> <span class="style_symbol">{</span> A'<span class="style_symbol">[</span> i <span class="style_symbol">]</span> : <span class="style_symbol">=</span> temp <span class="style_symbol">}</span> <span class="style_symbol">}</span> b_deleteDuplicates<span class="style_symbol">(</span> A<span class="style_symbol">[</span> <span class="style_int">0</span>...n <span class="style_symbol">-</span> <span class="style_int">1</span> <span class="style_symbol">]</span> <span class="style_symbol">)</span> :A'<span class="style_symbol">[</span> <span class="style_int">0</span>...n <span class="style_symbol">-</span> <span class="style_int">1</span> <span class="style_symbol">]</span> <span class="style_symbol">{</span> <span class="style_keyword">for</span><span class="style_symbol">(</span> i <span class="style_symbol">=</span> <span class="style_int">0</span> to n <span class="style_symbol">-</span> <span class="style_int">1</span> <span class="style_symbol">)</span> do <span class="style_symbol">{</span> A'<span class="style_symbol">[</span> i <span class="style_symbol">]</span> : <span class="style_symbol">=</span> <span class="style_keyword">null</span> <span class="style_symbol">}</span> <span class="style_keyword">for</span><span class="style_symbol">(</span> i <span class="style_symbol">=</span> <span class="style_int">0</span> to n <span class="style_symbol">-</span> <span class="style_int">1</span> <span class="style_symbol">)</span> do <span class="style_symbol">{</span> h: <span class="style_symbol">=</span> H<span class="style_symbol">(</span> A<span class="style_symbol">[</span> i <span class="style_symbol">]</span> <span class="style_symbol">)</span> <span class="style_comment">// H ist universelle Hashfkt die ganzzahlig in [0,...,n-1] abbildet</span> A'<span class="style_symbol">[</span> h <span class="style_symbol">]</span> : <span class="style_symbol">=</span> A<span class="style_symbol">[</span> i <span class="style_symbol">]</span> <span class="style_symbol">}</span> <span class="style_symbol">}</span> <span class="style_keyword">return</span> A' </pre>
Diesen Code in Original-Formatierung anzeigen
select language
> jass
java
delphi
C++
php
GSL
galaxy
visualBasic
wurst
Text
Markdown
select style
default
bbcode - default
Jasscraft
> jasscraft html
visual
lightweight
lightweightNr
goto line:
Compare with:
text copy window
edit this code
post new code
a_deleteDuplicates( A[ 0...n - 1 ] ) :A'[ 0...n - 1 ] { buildHeap( A ) // as it's done in heapsort for( i = n downto 2 ) do { temp : = Heap.deleteMin } if( A'[ i - 1 ] != temp ) { A'[ i ] : = temp } } b_deleteDuplicates( A[ 0...n - 1 ] ) :A'[ 0...n - 1 ] { for( i = 0 to n - 1 ) do { A'[ i ] : = null } for( i = 0 to n - 1 ) do { h: = H( A[ i ] ) // H ist universelle Hashfkt die ganzzahlig in [0,...,n-1] abbildet A'[ h ] : = A[ i ] } } return A'