leetcode
文章平均质量分 60
sunycccccc
这个作者很懒,什么都没留下…
展开
-
LeetCode28.实现 strStr()
实现strStr()函数。给你两个字符串haystack和needle,请你在haystack字符串中找出needle字符串出现的第一个位置(下标从 0 开始)。如果不存在,则返回-1。裸KMP算法class Solution {public: void getNext(string needle, int* next){ int k=-1; int n = needle.size(); int j = 0;...原创 2021-05-25 00:50:03 · 64 阅读 · 0 评论 -
[leetcode]Maximum Length of Repeated Subarray
Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.简单dpclass Solution {public: int findLength(vector& A, vector& B) { int dp[1024原创 2017-11-11 22:53:50 · 156 阅读 · 0 评论 -
【LeetCode】Redundant Connection
In this problem, a tree is an undirected graph that is connected and has no cycles.The given input is a graph that started as a tree with N nodes (with distinct values 1, 2, ..., N), with one addi原创 2017-11-11 22:56:42 · 172 阅读 · 0 评论 -
[leetcode]Maximum Sum of 3 Non-Overlapping Subarrays
In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum.Each subarray will be of size k, and we want to maximize the sum of all 3*k entries.Return the res原创 2017-11-12 19:27:52 · 283 阅读 · 0 评论