Thinking and algorithms:
<1> defined in a two-dimensional array to hold the string defining a one-dimensional array to store the longest string.
<2> The longest string subject to find ways to do the preservative effect.
<3> output string.
flow chart:
Problems encountered and solutions:
<1> how to do to save the string at the same time to compare the size.
Use nested loops to solve.
<2> How to size comparison.
Save subscript.
Core code:
