This is a classic parsing data structure cost-effective method, and through their own thinking and write new code, which is based on the C language Date : 2025-08-13
Size : 31kb
User : 桀骜不驯
This is a classic case of data structure and algorithm design, the code is not unique, the largest m sub segment and source code and dynamic programming ppt analysis Date : 2025-08-13
Size : 1.92mb
User : 桀骜不驯
Find the number of palindrome subsequences of a string of no longer than 15 (subsequence length >=1). Input description Enter a string of no more than 15, and the string is represented by lowercase letters Output descrip Date : 2025-08-13
Size : 2kb
User : zhou-r16
Topic description:Given an array a[0,..., n-1], find its maximum sum of subarray (length >=1) Input description:The first row is an integer n (1<=n<=5000), and then n integers are entered sequentially (each integer range Date : 2025-08-13
Size : 2kb
User : zhou-r16