Today's lesson is a lot of fun.
We'll integrate what we've learned recently about
Strings, algortihms, and then functions.
And then we'll get some practice approaching a few new problems using
But first, we have a few new things to cover.
When we started working with variables and Java's eight primitive types, we observed that there were certain types of assignments that would fail. For example:
But, there are also other kinds of assignments from one type to another that will succeed:
Let's discuss why that is, and how to can force Java to perform certain type changes when necessary.
Strings Are Immutable
One of the important things to understand about Java's
Strings is that none of the methods that we can call on them change that
Instead, they always return a new
String that may be modified in some way.
Let's see that in action:
Now let's have some fun and write a few new algorithms that work on
First, let's try and write a function that determines if a
String contains a particular character.
We'll sketch our our algorithm first, explore some potentially useful
String methods, and construct and test a solution.
Frequently when computers work with text data, we are processing data that was itself created by a machine. Or set up for machines to easily process.
One example is data stored in comma-separated-value format.
Let's say we wanted to track how many people were tested for some random respiratory illness each day.
We might save that data in a
String that looked like this:
(Note that this is not real data!)
Let's experiment with how we might work with this kind of data.
We'll use some existing
String methods and a few new ones.
We'll also use another unfamiliar method:
Integer.parseInt, which allows us to convert a
String to an