![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
杂题
旻宇
New Acmer
展开
-
Codeforces Round #243 (Div. 1) A Sereja and Swaps
URL:http://codeforces.com/contest/425/problem/A A. Sereja and Swaps time limit per test原创 2014-05-10 23:52:31 · 776 阅读 · 0 评论 -
Codeforces Round #245 (Div. 2) A - Points and Segments (easy)
无力吐槽的水题,水到你都不敢相信会有原创 2014-05-13 16:24:40 · 867 阅读 · 0 评论 -
Leetcode #238 Product of Array Except Self
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements ofnums except nums[i].Solve it without division and in O(原创 2015-07-31 12:41:27 · 350 阅读 · 0 评论 -
Leetcode #233 Number of Digit One
Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.For example:Given n = 13,Return 6, because digit 1 occurred in the follow原创 2015-08-01 14:23:27 · 406 阅读 · 0 评论 -
Leetcode #234 Palindrome Linked List
Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?用o(1)的space来创建一个反向的链表,也能AC,时间是36ms,代码如下:class Solution {public: bool isPa原创 2015-08-01 16:57:07 · 338 阅读 · 0 评论 -
Leetcode #228 Summary Ranges
Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].Credits:Special thanks to @jianchao.li.fighter fo原创 2015-08-01 21:48:03 · 384 阅读 · 0 评论 -
Leetcode #242 Valid Anagram
Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false.Note:You may assum原创 2015-08-01 19:57:25 · 524 阅读 · 0 评论 -
Leetcode #223 Rectangle Area
Find the total area covered by two rectilinear rectangles in a2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Assume that the total a原创 2015-08-02 17:16:27 · 388 阅读 · 0 评论 -
360公司 2016校园招聘在线笔试编程题
第一题将考研分数分类#include int main(){ int t, a, b, c, d, s; scanf("%d", &t); while(t--){ scanf("%d %d %d %d", &a, &b, &c, &d); s = a + b + c + d; if(a < 60 || b <60原创 2015-09-15 22:22:50 · 774 阅读 · 0 评论