Diberikan daftar / larik kosong yang hanya berisi bilangan bulat non-negatif seperti ini:

[0, 0, 0, 8, 1, 4, 3, 5, 6, 4, 1, 2, 0, 0, 0, 0]

Keluarkan daftar dengan trailing dan nol terkemuka dihapus

Output untuk ini adalah:

[8, 1, 4, 3, 5, 6, 4, 1, 2]

Beberapa test case lainnya:

[0, 4, 1, 2, 0, 1, 2, 4, 0] > [4, 1, 2, 0, 1, 2, 4]
[0, 0, 0, 0, 0, 0] > nothing
[3, 4, 5, 0, 0] > [3, 4, 5]
[6] > [6]

Kode terpendek menang

Jelly , 2 byte

Kode:

t0

Penjelasan:

t   # Trim off...
 0  #  zero at both sides

Cobalah online!

JavaScript (ES6) 43

a=>(f=a=>a.reverse().filter(x=>a|=x))(f(a))

Kurang golf

a=>{
  f=a=>a.reverse().filter(x=>a|=x) // reverse and remove leading 0
  // leverage js cast rules: operator | cast operands to integer
  // an array casted to integer is 0 unless the array is made of
  // a single integer value (that is ok for me in this case)
  return f(f(a)) // apply 2 times
}

Uji

F=a=>(f=a=>a.reverse().filter(x=>a|=x))(f(a))

function test(){
  var l=(I.value.match(/\d+/g)||[]).map(x=>+x)
  O.textContent=F(l)
}

test()

#I { width:90%}

<input id=I oninput='test()' value='0 0 1 3 7 11 0 8 23 0 0 0'>
<pre id=O></pre>

CJam, 13 byte

l~{_{}#>W%}2*

Dengan memasukkan array.

Versi yang lebih panjang:

l~             Puts input on the stack and parse as array
  {       }    Code block
   _           Duplicate the first thing on the stack
    {}#        Finds the index of the first non-0 value in the array, puts it on the stack
       >       Slices the array from that index
        W%     Reverses the array
           2*  Does the code block twice in total

Pyth, 4 byte

.sQ0

Demo:

llama@llama:~$ pyth -c .sQ0
[0, 0, 0, 1, 2, 0, 3, 4, 0, 0, 5, 0, 0, 0, 0]
[1, 2, 0, 3, 4, 0, 0, 5]

Dari Pyth'srev-doc.txt :

.s <seq> <any>
    Strip from A maximal prefix and suffix of A consisting of copies of B.

05AB1E , 4 byte

Kode:

0Û0Ü

Cobalah online!

Penjelasan:

0Û    # Trim off leading zeroes
  0Ü  # Trim off trailing zeroes

Menggunakan pengodean CP-1252.

Retina, 12 byte

^0 ?

)` 0$

Linefeed tambahan sangat penting.

Terima kasih kepada @Martin Büttner dan @FryAmTheEggman karena telah menghemat beberapa byte.

Cobalah online

R, 43 byte

function(x)x[cummax(x)&rev(cummax(rev(x)))]

atau sebagai baca / tulis STDIN / STDOUT

x=scan();cat(x[cummax(x)&rev(cummax(rev(x)))])

Ini menemukan maksimum kumulatif dari string awal dan akhir (terbalik). The &Operator mengkonversi dua vektor ini untuk satu logis dari ukuran yang sama seperti x, (nol akan selalu dikonversi ke FALSEdan segala sesuatu yang lain untuk TRUE), cara ini memungkinkan subset dari xsesuai dengan kondisi terpenuhi.

Haskell , 29 byte

t=f.f;f=reverse.dropWhile(<1)

Mathematica 34 27 byte

#//.{0,a___}|{a___,0}:>{a}&

Ini berulang kali menerapkan aturan penggantian sampai tindakan tersebut gagal memberikan output baru. 7 byte disimpan berkat Alephalpha.

Aturan pertama menghapus nol di awal; aturan kedua menghapus nol di akhir array.

05AB1E, 4 byte

0Û0Ü

Pada dasarnya memangkas memimpin lalu membuntuti nol input, diberikan sebagai array.

Cobalah online!

Perl, 19 + 1 = 20 byte

s/^(0 ?)+|( 0)+$//g

Membutuhkan -pbendera:

$ perl -pE's/^(0 )+|( 0)+$//g' <<< '0 0 0 1 2 3 4 5 6 0 0 0'
1 2 3 4 5 6

Jelly, 10 byte

Uo\U,o\PTị

Ini tidak menggunakan builtin.

Uo\U            Backward running logical OR
    ,           paired with
     o\         Forward running logical OR
       P        Product
        T       All indices of truthy elements
         ị      Index the input at those values.

Coba di sini .

Perl, 38 byte

$\.=$_}{$\=~s/^(0\n)*|(0\n)*\n$//gs

Jalankan dengan perl -p, (3 byte ditambahkan untuk -p).

Menerima angka pada STDIN, satu per baris; memancarkan angka pada STDOUT, satu per baris, sebagaimana seharusnya utilitas unix yang berperilaku baik.

Hanya memperlakukan angka yang diwakili dengan tepat oleh '0' sebagai nol; akan mungkin untuk mendukung representasi lain dengan beberapa byte lagi di regex.

Versi lebih lama, masih harus dijalankan dengan -p:

    # append entire line to output record separator
    $\.=$_
}{
    # replace leading and trailng zeroes in output record separator
    $\ =~ s/^(0\n)*|(0\n)*\n$//gs
    # output record separator will be implicitly printed

Versi yang diperluas, menunjukkan interaksi dengan flag -p:

# implicit while loop added by -p
while (<>) {
    # append line to output record separator
    $\.=$_
}{ # escape the implicit while loop
    # replace leading and traling 
    $\=~s/^(0\n)*|(0\n)*\n$//gs
    # print by default prints $_ followed by
    # the output record separator $\ which contains our answer
    ;print # implicit print added by -p
} # implicit closing brace added by -p

Elixir, 77 byte

import Enum
z=fn x->x==0 end
reverse(drop_while(reverse(drop_while(l,z)),z))

l adalah array.

Edit: wah! salin / pasta gagal. tentu saja kita harus mengimpor Enum, yang meningkatkan jumlah byte sebanyak 12 (atau menggunakan Enum.function_name, yang akan membuatnya lebih lama).

Vitsy, 13 byte

Vitsy perlahan menjadi lebih baik ... (Aku datang untukmu Jelly. ಠ_ಠ)

1mr1m
D)[X1m]

Ini keluar dengan array di stack. Agar mudah dibaca, TryItOnline! tautan yang saya berikan di bawah penjelasan akan menampilkan daftar yang diformat.

Penjelasan:

1mr1m
1m      Do the second line of code.
  r     Reverse the stack.
   1m   I'ma let you figure this one out. ;)

D)[X1m]
D       Duplicate the top item of the stack.
 )[   ] If the top item of the stack is zero, do the stuff in brackets.
   X    Remove the top item of the stack.
    1m  Execute the second line of code.

Perhatikan bahwa ini akan melempar StackOverflowException untuk input besar yang tidak masuk akal.

TryItOnline!

R, 39 byte

function(x)x[min(i<-which(x>0)):max(i)]

Empat byte lebih pendek dari jawaban R David Arenburg ini . Implementasi ini menemukan indeks pertama dan terakhir dalam array yang lebih besar dari nol, dan mengembalikan semuanya dalam array di antara kedua indeks tersebut.

MATL , 9 byte

2:"PtYsg)

Cobalah online!

Penjelasan

2:"     % For loop (do the following twice)
  P     %   Flip array. Implicitly asks for input the first time
  t     %   Duplicate
  Ys    %   Cumulative sum
  g     %   Convert to logical index
  )     %   Apply index
        % Implicitly end for
        % Implicitly display stack contents

Dyalog APL, 15 bytes

{⌽⍵↓⍨+/0=+\⍵}⍣2

               ⍣2     Apply this function twice:
{             }       Monadic function:
           +\⍵        Calculate the running sum.
       +/0=           Compare to zero and sum. Number of leading zeroes.
   ⍵↓⍨               Drop the first that many elements from the array.
 ⌽                   Reverse the result.

Try it here.

Ruby, 49 44 bytes

->a{eval ?a+'.drop_while{|i|i<1}.reverse'*2}

Thanks to manatwork for chopping off 5 bytes with a completely different method!

This just drops the first element of the array while it's 0, reverses the array, repeats, and finally reverses the array to return it to the proper order.

Vim 16 Keystrokes

i<input><esc>?[1-9]<enter>lD0d/<up><enter>

The input is to be typed by the user between i and esc, and does not count as a keystroke. This assumes that there will be at least one leading and one trailing zero. If that is not a valid assumption, we can use this slightly longer version: (18 Keystrokes)

i <input> <esc>?[1-9]<enter>lD0d/<up><enter>

ES6, 51 bytes

f=a=>a.map(x=>x?t=++i:f<i++||++f,f=i=0)&&a.slice(f,t)

t is set to the index after the last non-zero value, while f is incremented as long as only zeros have been seen so far.

Perl 6, 23 bytes

{.[.grep(?*):k.minmax]}
{.[minmax .grep(?*):k]}

Usage:

# replace the built-in trim subroutine
# with this one in the current lexical scope
my &trim = {.[.grep(?*):k.minmax]}

say trim [0, 0, 0, 8, 1, 4, 3, 5, 6, 4, 1, 2, 0, 0, 0, 0];
# (8 1 4 3 5 6 4 1 2)
say trim [0, 4, 1, 2, 0, 1, 2, 4, 0];
# (4 1 2 0 1 2 4)
say trim [0, 0, 0, 0, 0, 0];
# ()
say trim [3, 4, 5, 0, 0];
# (3 4 5)
say trim [6];
# (6)

Retina, 11 bytes

+`^0 ?| 0$
<empty>

Quite simple. Recursively replaces zeroes at beginning and end of line.

Try it online!

JavaScript (ES6), 47 bytes

a=>a.join(a="").replace(/(^0+|0+$)/g,a).split(a)

Where a is the array.

Python, 84 characters

def t(A):
 if set(A)<={0}:return[]
 for i in(0,-1):
  while A[i]==0:del A[i]
 return A

JavaScript (ES6), 34 bytes

a=>a.replace(/^(0 ?)*|( 0)*$/g,'')

Input and output are in the form of a space-delimited list, such as "0 4 1 2 0 1 2 4 0".

Javascript (ES6) 40 bytes

a=>/^(0,)*(.*?)(,0)*$/.exec(a.join())[2]

PHP, 56 54 52 bytes

Uses Windows-1252 encoding

String based solution

<?=preg_replace(~ÜÒ×ßÏÖÔƒ×ßÏÖÔÛÜ,"",join($argv,~ß));

Run like this:

echo '<?=preg_replace(~ÜÒ×ßÏÖÔƒ×ßÏÖÔÛÜ,"",join($argv,~ß));' | php -- 0 0 123 234 0 500 0 0 2>/dev/null;echo

If your terminal is set to UTF-8, this is the same:

echo '<?=preg_replace("#-( 0)+|( 0)+$#","",join($argv," "));' | php -- 0 0 123 234 0 500 0 0 2>/dev/null;echo

Tweaks

• Saved 2 bytes by negating strings and dropping string delimiters
• Saved 2 bytes by using short print tag

Python 2, 69 67 bytes

def f(a):
 for i in(0,-1):
  while a and a[i]==0:a.pop(i)
 return a

PowerShell, 49 bytes

($args[0]-join',').trim(',0').trim('0,')-split','

Takes input $args[0] and -joins them together with commas to form a string. We then use the .Trim() function called twice to remove first the trailing and then the leading zeros and commas. We then -split the string on commas back into an array.

Alternate version, without using conversion
PowerShell, 81 bytes

function f{param($a)$a=$a|%{if($_-or$b){$b=1;$_}};$a[$a.Count..0]}
f(f($args[0]))

Since PowerShell doesn't have a function to trim arrays, we define a new function f that will do half of this for us. The function takes $a as input, then loops through each item with a foreach loop |%{...}. Each iteration, we check a conditional for $_ -or $b. Since non-zero integers are truthy, but $null is falsey (and $b, being not previously defined, starts as $null), this will only evaluate to $true once we hit our first non-zero element in the array. We then set $b=1 and add the current value $_ onto the pipeline. That will then continue through to the end of the input array, with zeros in the middle and the end getting added onto the output, since we've set $b truthy.

We encapsulate and store the results of the loop all back into $a. Then, we index $a in reverse order (i.e., reversing the array), which is left on the pipeline and thus is the function's return value.

We call the function twice on the $args[0] input to the program in order to "trim" from the front, then the front again (which is the back, since we reversed). The order is preserved since we're reversing twice.

This version plays a little loose with the rules for an input array of all zeros, but since ignoring STDERR is accepted practice, the program will spit out two (verbose) Cannot index into a null array errors to _{(PowerShell's equivalent of)} STDERR and then output nothing.