emoheithree的博客

刷oj时每次都手动输入很不方便---好在输入段其实也是一种流我们可以使用文件定向到标准输入与输出流来简便处理输入与输出问题。 先接受下函数 FILE * freopen ( const char * filename, const char * mode, FILE * stream ); 【参数说明】 filename: 要打开的文件名 mode: 文件打开的模式，和fope

Parencodings Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 27370 Accepted: 16089 Description Let S = s1s2...s2n be a well-formed string of parent

Radar Installation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 91342 Accepted: 20438 Description Assume thecoasting is an infinite straight lin

LeetCode 40. Combination Sum II Given acollection of candidate numbers (C) and a target number (T),find all unique combinations in C where the candidatenumbers sums to T. Each numberin C may only be

17. Letter Combinations of a Phone Number Given a digit string, return all possible letter combinationsthat the number could represent. A mapping of digit to letters (just like on the telephonebutto

poj  3094 Quicksum 水   Quicksum Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17095 Accepted: 11865 Description A checksum is analgorithm that

POJ 2739 Sum of Consecutive Prime Numbers Sum of Consecutive Prime Numbers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 26176 Accepted: 14204 De

poj 3006 Dirichlet's Theorem onArithmetic Progressions Dirichlet's Theorem on Arithmetic Progressions Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 19133 Ac

Tree Recovery Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15363 Accepted: 9510 Description Little Valentineliked playing with binary trees very

45. Jump Game II Given an array of non-negative integers, you are initiallypositioned at the first index of the array. Each element in the array represents your maximum jump length atthat position.

Given n non-negativeintegers representing an elevation map where the width of each bar is 1,compute how much water it is able to trap after raining. For example,  Given [0,1,0,2,1,0,1,3,2,1,2,1]

41. First Missing Positive Given an unsorted integer array, find the first missing positiveinteger. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. Your algorithm should run in O(n)

leetcode   题目 The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H

POJ  2159  Ancient Cipher   Ancient Cipher Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 35432 Accepted: 11550 Description Ancient Romanempire

Adapted fromWikipedia, the free encyclopedia The humidex is ameasurement used by Canadian meteorologists to reflect the combined effect ofheat and humidity. It differs from the heat index used in the

LeetCode 46. Permutations Given a collection of distinct numbers,return all possible permutations.   For example, [1,2,3] have the following permutations: [  [1,2,3],  [1,3,2],  [2,1,3],  [2,