丧心病狂工科女

2019年4月15日

#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 丧心病狂工科女阅读(132) 评论(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 丧心病狂工科女阅读(106) 评论(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 丧心病狂工科女阅读(124) 评论(0) 推荐(0) 编辑

2019年4月14日

CodeForces Round #547 Div.3

摘要： A. Game 23 #include <bits/stdc++.h> using namespace std; int N, M; int main() { int ans = 0; int cnt = 0; scanf("%d%d", &N, &M); if(N == M) ans = 0; e 阅读全文

posted @ 2019-04-14 23:55 丧心病狂工科女阅读(143) 评论(0) 推荐(0) 编辑

2019年4月13日

#Leetcode# 1016. Binary String With Substrings Representing 1 To N

摘要： https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n/ Given a binary string S (a string consisting only of '0' and '1's) an 阅读全文

posted @ 2019-04-13 09:37 丧心病狂工科女阅读(416) 评论(0) 推荐(0) 编辑

#Leetcode# 233. Number of Digit One

摘要： https://leetcode.com/problems/number-of-digit-one/ Given an integer n, count the total number of digit 1 appearing in all non-negative integers less t 阅读全文

posted @ 2019-04-13 09:16 丧心病狂工科女阅读(123) 评论(0) 推荐(0) 编辑

#Leetcode# 633. Sum of Square Numbers

摘要： https://leetcode.com/problems/sum-of-square-numbers/ Given a non-negative integer c, your task is to decide whether there're two integers a and b such 阅读全文

posted @ 2019-04-13 09:05 丧心病狂工科女阅读(136) 评论(0) 推荐(0) 编辑

#Leetcode# 1009. Complement of Base 10 Integer

摘要： https://leetcode.com/problems/complement-of-base-10-integer/ Every non-negative integer N has a binary representation. For example, 5 can be represent 阅读全文

posted @ 2019-04-13 08:57 丧心病狂工科女阅读(281) 评论(0) 推荐(0) 编辑

2019年4月12日

#Leetcode# 942. DI String Match

摘要： https://leetcode.com/problems/di-string-match/ Given a string S that only contains "I" (increase) or "D" (decrease), let N = S.length. Return any perm 阅读全文

posted @ 2019-04-12 22:56 丧心病狂工科女阅读(192) 评论(0) 推荐(0) 编辑

#Leetcode# 728. Self Dividing Numbers

摘要： https://leetcode.com/problems/self-dividing-numbers/ A self-dividing number is a number that is divisible by every digit it contains. For example, 128 阅读全文

posted @ 2019-04-12 19:19 丧心病狂工科女阅读(191) 评论(0) 推荐(0) 编辑

丧心病狂工科女

公告