摘要：
目录0 前言1 项目前端介绍1.1 项目启动和编译1.1.1 项目启动1.1.2 项目编译1.2 前端技术栈1.3 功能模块前端界面展示1.3.1 基础功能模块1.3.2 用户模块1.3.3 特色功能展示1.3.4 界面自适应实现2 项目后端介绍2.1 项目打包部署2.1.1 项目打包2.1.2 项 阅读全文
摘要：
1. 题目 Formation is very important when taking a group photo. Given the rules of forming K rows with N people as the following: The number of people in 阅读全文
摘要：
1. 题目 Given any string of N (≥5) characters, you are asked to form the characters into the shape of U. For example, helloworld can be printed as: h d 阅读全文
摘要：
1. 题目 Given an integer with no more than 9 digits, you are supposed to read it in the traditional Chinese way. Output Fu first if it is negative. For 阅读全文
摘要：
1. 题目 Look-and-say sequence is a sequence of integers as the following: D, D1, D111, D113, D11231, D112213111, ... where D is in [0, 9] except 1. The 阅读全文
摘要：
1. 题目 On a broken keyboard, some of the keys are always stucked. So when you type some sentences, the characters corresponding to those keys will appe 阅读全文
摘要：
1. 题目 People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops". A 阅读全文
摘要：
1. 题目 The Japanese language is notorious for its sentence ending particles. Personal preference of such particles can be considered as a reflection of 阅读全文
摘要：
1. 题目 Sherlock Holmes received a note with some strange strings: Let's date! 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&hgsfdk d&Hyscvnm. It took him only a 阅读全文
摘要：
1. 题目 Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English. Input Spec 阅读全文