Bash and Ruby solutions for week 97, part 2

3 files changed, 94 insertions, 0 deletions

diff --git a/challenge-097/abigail/README.md b/challenge-097/abigail/README.md
index a30913db45..3427067f32 100644
--- a/challenge-097/abigail/README.md
+++ b/challenge-097/abigail/README.md
@@ -87,10 +87,12 @@ of a section.
 
 ### Solutions
 * [AWK](awk/ch-2.awk)
+* [Bash](bash/ch-2.sh)
 * [C](c/ch-2.c)
 * [Lua](lua/ch-2.lua)
 * [Node](node/ch-2.js)
 * [Perl](perl/ch-2.pl)
 * [Python](python/ch-2.py)
+* [Ruby](ruby/ch-2.rb)
 
 ### Blog
diff --git a/challenge-097/abigail/bash/ch-2.sh b/challenge-097/abigail/bash/ch-2.sh
new file mode 100644
index 0000000000..ad82b5ecab
--- /dev/null
+++ b/challenge-097/abigail/bash/ch-2.sh
@@ -0,0 +1,45 @@
+#!/bin/sh
+
+#
+# See ../README.md
+#
+
+#
+# Run as: bash ch-2.sh -s SECTIONS < input-file
+#
+
+#
+# Disable pathname expansion
+#
+set -f
+
+#
+# Read the option
+#
+while getopts "s:" name
+do  if [ "$name" = "s" ]
+    then sections=$OPTARG
+    fi
+done
+
+
+#
+# Iterate over the input. For each position, count the number of 0s,
+# and calculate the number of 1s. Sum the minimum of those numbers.
+#
+while read line
+do    s_len=$((${#line} / $sections))
+      sum=0
+      for ((i = 0; i < s_len; i ++))
+      do   zeros=0
+           for ((j = 0; j < sections; j ++))
+           do    index=$(($j * $s_len + $i))
+                 if   [ "${line:$index:1}" == "0" ]
+                 then zeros=$(($zeros + 1))
+                 fi
+           done
+           ones=$(($sections - $zeros))
+           sum=$(($sum + ($zeros < $ones ? $zeros : $ones) ))
+      done
+      echo $sum
+done
diff --git a/challenge-097/abigail/ruby/ch-2.rb b/challenge-097/abigail/ruby/ch-2.rb
new file mode 100644
index 0000000000..06607c29d7
--- /dev/null
+++ b/challenge-097/abigail/ruby/ch-2.rb
@@ -0,0 +1,47 @@
+#!/usr/bin/ruby
+
+#
+# See ../README.md
+#
+ 
+#
+# Run as: ruby ch-2.rb -s SECTIONS < input-file
+#
+
+require 'optparse'
+
+NR_OF_LETTERS = 26
+
+
+#
+# Parse and validate options
+#
+params   = ARGV . getopts ('s:')
+sections = params ["s"] ? params ["s"] . to_i : -1
+
+if sections < 0
+    STDERR . puts "Requires a -s SECTIONS option"
+    exit 1
+end
+
+
+#
+# Iterate over the input. For each position, count the number of 0s,
+# and calculate the number of 1s. Sum the minimum of those numbers.
+#
+ARGF . each_line do |line|
+     s_len = (line . length - 1) / sections
+     sum = 0
+     for i in 0 .. s_len - 1 do
+         zeros = 0
+         for j in 0 .. sections - 1 do
+             index = j * s_len + i
+             if   line [index, 1] == "0"
+             then zeros += 1
+             end
+         end
+         ones = sections - zeros
+         sum += [zeros, ones] . min
+     end
+     puts sum
+end