Programmer Group

1. (1): judge whether open parentheses and closed parentheses in an arithmetic expression are paired. Implementation code: #include <stdio.h> #include <stdlib.h> #define MAXSIZE 100 typedef struct{ char data[MAXSIZE]; int top; }seqstack; int MatchCheck(char str[]){ seqstack s; int i = 0; s.top = -1; while (str[i] != '\0'){ ...

summary As we all know, the summary algorithm is also a particularly important existence in the security field, and SHA256 is one of the most common summary algorithms. Its characteristic is that it has low computational complexity. The equal length summary value can be obtained by inputting the original text of unequal length data, which ...

The happiest thing at the weekend is to fill in questions and write solutions to cook for his wife. Weekly portal 2037. Make each student have the minimum number of seat movements Idea: greed Time complexity: O ( n ∗ ...

LeetCode 18. Sum of four numbers Title: Give you an array of n integers, nums, and a target value, target. Please find and return the quads [nums[a], nums[b], nums[c], nums[d]]: 0 <= a, b, c, d < na. b, c and d are different from each othernums[a] + nums[b] + nums[c] + nums[d] == target You can return answers in any order. Example: ...

search 1. Sequential search Through subscripts, we can access and search data items in order. This technology is called "sequential search" def sequentialSearch(alist,item): pos = 0 found = False while pos<len(alist) and not found: if alist[pos] == item: found = True else: ...

The repetition number of a string is defined as the maximum number R such that the string can be partitioned into R same consecutive substrings. For example, the repetition number of "ababab" is 3 and "ababa" is 1. Given a string containing lowercase letters, you are to find a substring of it with maximum repetition number. Input The input c ...

Monotone stack handles the problem of size comparison in the overall O(n) time by maintaining the monotonic increment (decrement) of the value in the stack. 739 daily temperature Given the daily temperature, it is required to wait a few days for each day to wait for a warmer day. If there is no warmer weather after that day, it is recorded as ...

Tip: after the article is written, the directory can be generated automatically. Please refer to the help document on the right for how to generate it 1, What is the time complexity? The algorithm takes the highest order after adding the calculation times, ignoring the constant and the rest If sorting is selected, n+n-1+n-2 + The calcu ...

Write in front I've been busy with my work in the past two months and haven't taken time to take care of my blog. It's rare to take a day off today. I want to review a little bit from the most basic algorithm, and constantly improve my study while reviewing. I want to implement my own small algorithm library by the end of May next year. W ...

7-1 packing problem import java.util.Scanner; public class Program1 { public static void main(String[] args) { int N; Scanner in = new Scanner(System.in); N = in.nextInt(); int []things = new int[N]; //Up to N boxes int []box = new int[N]; //Record the maximum number of boxes ...