How to implement the appearance sequence of Go Java algorithm
Appearance sequence
Given a positive integer n, output the nth item of the appearance sequence.
"Appearance sequence" is a sequence of integers, starting from the number 1, and each item in the sequence is a description of the previous item.
You can think of it as a sequence of numeric strings defined by a recursive formula:
countAndSay(1) = "1"
countAndSay(n) is a description of countAndSay(n-1), which is then converted into another numeric string.
The first five items are as follows:
1, 1 —— The first item is the number 1
2, 11 - Describe the previous item, this number is 1, that is, "a 1", recorded as "11"
3, 21 - Describe the previous item item, this number is 11, which is "two 1s", recorded as "21"
4, 1211 - describe the previous item, this number is 21, which is "one 2" One 1", recorded as "1211"
- ##5, 111221 - Describe the previous item, this number is 1211, that is, "one 1, one 2, two 1", recorded as "111221"
countAndSay(1) = "1";countAndSay(n) is Description of countAndSay(n-1) and then converted to another numeric string.We define the string S_{i} to represent countAndSay(i). If we require S_{n}, we need to find S_{n-1} first, and then follow the above description Method generation, that is, scanning the maximum number of consecutive identical characters in the string S_{n-1} from left to right, then converting the statistical number of characters into a numerical string and concatenating the corresponding characters.
class Solution { public String countAndSay(int n) { String str = "1"; for (int i = 2; i <= n; ++i) { StringBuilder sb = new StringBuilder(); int start = 0; int pos = 0; while (pos < str.length()) { while (pos < str.length() && str.charAt(pos) == str.charAt(start)) { pos++; } sb.append(Integer.toString(pos - start)).append(str.charAt(start)); start = pos; } str = sb.toString(); } return str; } }
func countAndSay(n int) string { if n == 1 { return "1" } s := countAndSay(n - 1) i, res := 0, "" length := len(s) for j := 0; j < length; j++ { if s[j] != s[i] { res += strconv.Itoa(j-i) + string(s[i]) i = j } } res += strconv.Itoa(length-i) + string(s[i]) return res }
The above is the detailed content of How to implement the appearance sequence of Go Java algorithm. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

AI Hentai Generator
Generate AI Hentai for free.

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

Guide to Square Root in Java. Here we discuss how Square Root works in Java with example and its code implementation respectively.

Guide to Perfect Number in Java. Here we discuss the Definition, How to check Perfect number in Java?, examples with code implementation.

Guide to Random Number Generator in Java. Here we discuss Functions in Java with examples and two different Generators with ther examples.

Guide to Weka in Java. Here we discuss the Introduction, how to use weka java, the type of platform, and advantages with examples.

Guide to the Armstrong Number in Java. Here we discuss an introduction to Armstrong's number in java along with some of the code.

Guide to Smith Number in Java. Here we discuss the Definition, How to check smith number in Java? example with code implementation.

In this article, we have kept the most asked Java Spring Interview Questions with their detailed answers. So that you can crack the interview.

Java 8 introduces the Stream API, providing a powerful and expressive way to process data collections. However, a common question when using Stream is: How to break or return from a forEach operation? Traditional loops allow for early interruption or return, but Stream's forEach method does not directly support this method. This article will explain the reasons and explore alternative methods for implementing premature termination in Stream processing systems. Further reading: Java Stream API improvements Understand Stream forEach The forEach method is a terminal operation that performs one operation on each element in the Stream. Its design intention is
