Count and Say (unsolved)🌟

The count-and-say sequence is the sequence of integers beginning as follows:

1, 11, 21, 1211, 111221, ...

1 is read off as "one 1" or 11.
11 is read off as "two 1s" or 21.
21 is read off as "one 2, then one 1" or 1211.

Given an integer n, generate the nth sequence.


public class Solution {
    public String countAndSay(int n) {
        StringBuilder curr = new StringBuilder("1")l 
        StringBuilder prev; 
        int count; 
        char say; 
        for (int i = 1; i < n; i++) {
            prev = curr; 
            curr = new StringBuilder(); 
            count = 1; 
        }
    }
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s