Skip to main content
Code Golf

Return to Answer

edited body
Source Link
Neil
Neil
  • 177.3k
  • 12
  • 74
  • 281

Charcoal, 6464 62 bytes

ＷＳ⊞υι≔Ｅθ⪫⪪⭆υ§λκ-|¦#|υＦυＦΦ⪪ι#λ«Ｐ↓№κ|→→»←⸿⸿ＦＥ§υ⁰⌕Ａ⭆υ§λκ#Ｗι«⊕⁻⊟ι⊟ι→|¦#|θＦθＦΦ⪪ι#λ«Ｐ↓№κ|→→»←⸿⸿ＦＥυ⌕Ａ⭆θ§λκ#Ｗι«⊕⁻⊟ι⊟ι→

Try it online!Try it online! Link is to verbose version of code. Takes input as a rectangular list of newline-terminated strings. Explanation:

ＷＳ⊞υι

Input the stack of tables.

≔Ｅθ⪫⪪⭆υ§λκ-|¦#|υ|¦#|θ

Transpose the stack and identify the ends of the tabletops i.e. those parts above the legs.

ＦυＦΦ⪪ι#λ«ＦθＦΦ⪪ι#λ«

For each column of the original stack split it on tabletop ends, dropping the first element (which is the space above the first end) and loop over the resulting legs.

Ｐ↓№κ|→→

Print the length of the leg vertically (which Charcoal automatically translates into a line of |s) without moving the cursor and then allow two columns for the next leg.

»←⸿⸿

Move up to the start of the previous row but one.

ＦＥ§υ⁰⌕Ａ⭆υ§λκ#ＦＥυ⌕Ａ⭆θ§λκ#

Transpose the stack back and find all of the tabletop ends.

Ｗι«⊕⁻⊟ι⊟ι→

Loop over the ends in pairs, print the inclusive difference between each pair (which Charcoal automatically translates into a line of -s) and then allow a column for the next tabletop.

Charcoal, 64 bytes

ＷＳ⊞υι≔Ｅθ⪫⪪⭆υ§λκ-|¦#|υＦυＦΦ⪪ι#λ«Ｐ↓№κ|→→»←⸿⸿ＦＥ§υ⁰⌕Ａ⭆υ§λκ#Ｗι«⊕⁻⊟ι⊟ι→

Try it online! Link is to verbose version of code. Takes input as a rectangular list of newline-terminated strings. Explanation:

ＷＳ⊞υι

Input the stack of tables.

≔Ｅθ⪫⪪⭆υ§λκ-|¦#|υ

Transpose the stack and identify the ends of the tabletops i.e. those parts above the legs.

ＦυＦΦ⪪ι#λ«

For each column of the original stack split it on tabletop ends, dropping the first element (which is the space above the first end) and loop over the resulting legs.

Ｐ↓№κ|→→

Print the length of the leg vertically (which Charcoal automatically translates into a line of |s) without moving the cursor and then allow two columns for the next leg.

»←⸿⸿

Move up to the start of the previous row but one.

ＦＥ§υ⁰⌕Ａ⭆υ§λκ#

Transpose the stack back and find all of the tabletop ends.

Ｗι«⊕⁻⊟ι⊟ι→

Loop over the ends in pairs, print the inclusive difference between each pair (which Charcoal automatically translates into a line of -s) and then allow a column for the next tabletop.

Charcoal, 64 62 bytes

ＷＳ⊞υι≔Ｅθ⪫⪪⭆υ§λκ-|¦#|θＦθＦΦ⪪ι#λ«Ｐ↓№κ|→→»←⸿⸿ＦＥυ⌕Ａ⭆θ§λκ#Ｗι«⊕⁻⊟ι⊟ι→

Try it online! Link is to verbose version of code. Takes input as a rectangular list of newline-terminated strings. Explanation:

ＷＳ⊞υι

Input the stack of tables.

≔Ｅθ⪫⪪⭆υ§λκ-|¦#|θ

Transpose the stack and identify the ends of the tabletops i.e. those parts above the legs.

ＦθＦΦ⪪ι#λ«

For each column of the original stack split it on tabletop ends, dropping the first element (which is the space above the first end) and loop over the resulting legs.

Ｐ↓№κ|→→

Print the length of the leg vertically (which Charcoal automatically translates into a line of |s) without moving the cursor and then allow two columns for the next leg.

»←⸿⸿

Move up to the start of the previous row but one.

ＦＥυ⌕Ａ⭆θ§λκ#

Transpose the stack back and find all of the tabletop ends.

Ｗι«⊕⁻⊟ι⊟ι→

Loop over the ends in pairs, print the inclusive difference between each pair (which Charcoal automatically translates into a line of -s) and then allow a column for the next tabletop.

fix to explanation
Source Link
Neil
Neil
  • 177.3k
  • 12
  • 74
  • 281

Charcoal, 64 bytes

ＷＳ⊞υι≔Ｅθ⪫⪪⭆υ§λκ-|¦#|υＦυＦΦ⪪ι#λ«Ｐ↓№κ|→→»←⸿⸿ＦＥ§υ⁰⌕Ａ⭆υ§λκ#Ｗι«⊕⁻⊟ι⊟ι→

Try it online! Link is to verbose version of code. Takes input as a rectangular list of newline-terminated strings. Explanation:

ＷＳ⊞υι

Input the stack of tables.

≔Ｅθ⪫⪪⭆υ§λκ-|¦#|υ

Transpose the stack and identify the ends of the tabletops i.e. those parts above the legs.

ＦυＦ⁺Φ⪪ι#λ «ＦυＦΦ⪪ι#λ«

For each column of the original stack split it on tabletop ends, dropping the first element (which is the space above the first end) and loop over the resulting legs.

Ｐ↓№κ|→→

Print the length of the leg vertically (which Charcoal automatically translates into a line of |s) without moving the cursor and then allow two columns for the next leg.

»←⸿⸿

Move up to the start of the previous row but one.

ＦＥ§υ⁰⌕Ａ⭆υ§λκ#

Transpose the stack back and find all of the tabletop ends.

Ｗι«⊕⁻⊟ι⊟ι→

Loop over the ends in pairs, print the inclusive difference between each pair (which Charcoal automatically translates into a line of -s) and then allow a column for the next tabletop.

Charcoal, 64 bytes

ＷＳ⊞υι≔Ｅθ⪫⪪⭆υ§λκ-|¦#|υＦυＦΦ⪪ι#λ«Ｐ↓№κ|→→»←⸿⸿ＦＥ§υ⁰⌕Ａ⭆υ§λκ#Ｗι«⊕⁻⊟ι⊟ι→

Try it online! Link is to verbose version of code. Takes input as a rectangular list of newline-terminated strings. Explanation:

ＷＳ⊞υι

Input the stack of tables.

≔Ｅθ⪫⪪⭆υ§λκ-|¦#|υ

Transpose the stack and identify the ends of the tabletops i.e. those parts above the legs.

ＦυＦ⁺Φ⪪ι#λ «

For each column of the original stack split it on tabletop ends, dropping the first element (which is the space above the first end) and loop over the resulting legs.

Ｐ↓№κ|→→

Print the length of the leg vertically (which Charcoal automatically translates into a line of |s) without moving the cursor and then allow two columns for the next leg.

»←⸿⸿

Move up to the start of the previous row but one.

ＦＥ§υ⁰⌕Ａ⭆υ§λκ#

Transpose the stack back and find all of the tabletop ends.

Ｗι«⊕⁻⊟ι⊟ι→

Loop over the ends in pairs, print the inclusive difference between each pair (which Charcoal automatically translates into a line of -s) and then allow a column for the next tabletop.

Charcoal, 64 bytes

ＷＳ⊞υι≔Ｅθ⪫⪪⭆υ§λκ-|¦#|υＦυＦΦ⪪ι#λ«Ｐ↓№κ|→→»←⸿⸿ＦＥ§υ⁰⌕Ａ⭆υ§λκ#Ｗι«⊕⁻⊟ι⊟ι→

Try it online! Link is to verbose version of code. Takes input as a rectangular list of newline-terminated strings. Explanation:

ＷＳ⊞υι

Input the stack of tables.

≔Ｅθ⪫⪪⭆υ§λκ-|¦#|υ

Transpose the stack and identify the ends of the tabletops i.e. those parts above the legs.

ＦυＦΦ⪪ι#λ«

For each column of the original stack split it on tabletop ends, dropping the first element (which is the space above the first end) and loop over the resulting legs.

Ｐ↓№κ|→→

Print the length of the leg vertically (which Charcoal automatically translates into a line of |s) without moving the cursor and then allow two columns for the next leg.

»←⸿⸿

Move up to the start of the previous row but one.

ＦＥ§υ⁰⌕Ａ⭆υ§λκ#

Transpose the stack back and find all of the tabletop ends.

Ｗι«⊕⁻⊟ι⊟ι→

Loop over the ends in pairs, print the inclusive difference between each pair (which Charcoal automatically translates into a line of -s) and then allow a column for the next tabletop.

Source Link
Neil
Neil
  • 177.3k
  • 12
  • 74
  • 281

Charcoal, 64 bytes

ＷＳ⊞υι≔Ｅθ⪫⪪⭆υ§λκ-|¦#|υＦυＦΦ⪪ι#λ«Ｐ↓№κ|→→»←⸿⸿ＦＥ§υ⁰⌕Ａ⭆υ§λκ#Ｗι«⊕⁻⊟ι⊟ι→

Try it online! Link is to verbose version of code. Takes input as a rectangular list of newline-terminated strings. Explanation:

ＷＳ⊞υι

Input the stack of tables.

≔Ｅθ⪫⪪⭆υ§λκ-|¦#|υ

Transpose the stack and identify the ends of the tabletops i.e. those parts above the legs.

ＦυＦ⁺Φ⪪ι#λ «

For each column of the original stack split it on tabletop ends, dropping the first element (which is the space above the first end) and loop over the resulting legs.

Ｐ↓№κ|→→

Print the length of the leg vertically (which Charcoal automatically translates into a line of |s) without moving the cursor and then allow two columns for the next leg.

»←⸿⸿

Move up to the start of the previous row but one.

ＦＥ§υ⁰⌕Ａ⭆υ§λκ#

Transpose the stack back and find all of the tabletop ends.

Ｗι«⊕⁻⊟ι⊟ι→

Loop over the ends in pairs, print the inclusive difference between each pair (which Charcoal automatically translates into a line of -s) and then allow a column for the next tabletop.