2019年4月15日
Educational Codeforces Round 62
摘要： A. Detective Book 代码： #include <bits/stdc++.h> using namespace std; const int maxn = 1e4 + 10; int N; int a[maxn]; int maxx = 0; int main() { scanf("% 阅读全文
posted @ 2019-04-15 22:40 _Zlrrr 阅读(168) 评论(0) 推荐(0)
#Leetcode# 524. Longest Word in Dictionary through Deleting
摘要： https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/ Given a string and a string dictionary, find the longest string in the dict 阅读全文
posted @ 2019-04-15 21:14 _Zlrrr 阅读(132) 评论(0) 推荐(0)
#Leetcode# 274. H-Index
摘要： https://leetcode.com/problems/h-index/ Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to comp 阅读全文
posted @ 2019-04-15 16:36 _Zlrrr 阅读(126) 评论(0) 推荐(0)
#Leetcode# 985. Sum of Even Numbers After Queries
摘要： https://leetcode.com/problems/sum-of-even-numbers-after-queries/ We have an array A of integers, and an array queries of queries. For the i-th query v 阅读全文
posted @ 2019-04-15 15:52 _Zlrrr 阅读(135) 评论(0) 推荐(0)
#Leetcode# 238. Product of Array Except Self
摘要： https://leetcode.com/problems/product-of-array-except-self/ Given an array nums of n integers where n > 1, return an array output such that output[i]  阅读全文
posted @ 2019-04-15 01:00 _Zlrrr 阅读(107) 评论(0) 推荐(0)
#Leetcode# 81. Search in Rotated Sorted Array II
摘要： https://leetcode.com/problems/search-in-rotated-sorted-array-ii/ Suppose an array sorted in ascending order is rotated at some pivot unknown to you be 阅读全文
posted @ 2019-04-15 00:40 _Zlrrr 阅读(126) 评论(0) 推荐(0)