Online Judge
文章平均质量分 76
pickless
这个作者很懒,什么都没留下…
展开
-
PAT总结
--->PATPAT难度不大,30分的题目(最大分值)也只会考察到一些基本的算法和数据结构。我比较喜欢写Java,但是这个OJ对于Java并没有优待,内存和时间限制与其他语言一样。有很多题目,我刚刚读完输入数据就超时或者超内存了。所以我只能混着写,小部分题目(分值20、25)用Java写,大部分(分值25、30)用C++。这里主要记录一下一些比较容易犯错的地方和小部分题目的思路。原创 2012-12-05 02:53:06 · 1398 阅读 · 0 评论 -
LeetCode——Median of Two Sorted Arrays
Median of Two Sorted ArraysMar 28 '112878 / 15149There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time comple原创 2013-05-31 01:01:22 · 848 阅读 · 0 评论 -
LeetCode——Two Sum
Two SumMar 14 '116192 / 19574Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers s原创 2013-05-30 17:20:10 · 2746 阅读 · 3 评论 -
LeetCode——Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For原创 2013-06-04 00:41:07 · 2618 阅读 · 1 评论 -
LeetCode——Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link原创 2013-06-05 00:46:51 · 373 阅读 · 0 评论 -
LeetCode——Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.» Solve this problem原创 2013-06-06 17:12:28 · 1004 阅读 · 0 评论 -
LeetCode——ZigZag Conversion
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 NA P L S I原创 2013-06-06 19:37:02 · 1546 阅读 · 1 评论 -
LeetCode——Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321Have you thought about this?Here are some good questions to ask before coding. Bonus points for y原创 2013-06-06 19:50:12 · 970 阅读 · 1 评论 -
LeetCode——Roman To Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.» Solve this problem同Integer To Roman一题一样,建立常数表,直接处理。class Solution {public:原创 2013-06-07 17:26:37 · 661 阅读 · 0 评论 -
LeetCode——Regular Expression Matching
Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire input st原创 2013-06-06 23:26:54 · 3126 阅读 · 1 评论 -
LeetCode——Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). F原创 2013-06-07 16:38:43 · 518 阅读 · 0 评论 -
LeetCode——Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.» Solve this problemclass Solution {public: string longestCommonPrefix(vector &strs) { // S原创 2013-06-07 19:10:22 · 739 阅读 · 0 评论 -
LeetCode——Integer To Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.» Solve this problem定义常量数组直接转换。class Solution {public: const string rom原创 2013-06-07 17:03:55 · 918 阅读 · 1 评论 -
LeetCode——3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet原创 2013-06-19 20:39:01 · 586 阅读 · 0 评论 -
LeetCode——3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exa原创 2013-06-19 21:02:08 · 504 阅读 · 0 评论 -
LeetCode——Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, t原创 2013-06-20 17:18:06 · 412 阅读 · 0 评论 -
LeetCode——Letters Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit st原创 2013-06-20 17:05:55 · 684 阅读 · 0 评论 -
LeetCode——Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all va原创 2013-06-20 17:27:45 · 402 阅读 · 0 评论 -
LeetCode——4Sum
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note:原创 2013-06-20 16:53:49 · 802 阅读 · 1 评论 -
LeetCode——Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((()))", "(()())", "(())()", "()(())", "()原创 2013-06-21 01:29:36 · 1523 阅读 · 0 评论 -
LeetCode——Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space.原创 2013-06-21 21:03:12 · 718 阅读 · 0 评论 -
LeetCode——Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.» Solve this problem堆可以用来解决这个问题。C++的STL中priority_queue,优先队列就是堆结构。时间复杂度是O(NlogK),N是总数据个数,原创 2013-06-21 20:32:18 · 1718 阅读 · 0 评论 -
LeetCode——Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is原创 2013-06-21 21:57:32 · 500 阅读 · 0 评论 -
LeetCode——Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with原创 2013-06-22 00:03:25 · 362 阅读 · 0 评论 -
LeetCode——Implement strStr()
Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.» Solve this problem字符串匹配问题,KMP算法。我采用的是不是最高效最原始的KMP,而是使用了一原创 2013-06-22 13:37:30 · 421 阅读 · 0 评论 -
LeetCode——Divide Two Integers
Divide two integers without using multiplication, division and mod operator.» Solve this problem第一反应:用减法做。while (dividend >= divisor) { answer++; dividend -= divisor;}但是这样做会超时,例原创 2013-06-22 14:23:34 · 2154 阅读 · 0 评论 -
LeetCode——Substring with Concatenation of All Words
You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without原创 2013-06-27 15:41:02 · 671 阅读 · 0 评论 -
LeetCode——Next Permutation
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possible原创 2013-06-27 18:40:44 · 3172 阅读 · 4 评论 -
LeetCode——Search for a Range
Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not found原创 2013-06-27 20:29:57 · 1459 阅读 · 0 评论 -
LeetCode——Valid Sudoku
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partially fil原创 2013-06-28 17:19:57 · 2511 阅读 · 0 评论 -
LeetCode——Search in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array ret原创 2013-06-27 19:37:10 · 3243 阅读 · 2 评论 -
LeetCode——Longest Valid Parentheses
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()",原创 2013-06-27 19:12:13 · 1168 阅读 · 0 评论 -
LeetCode——Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.原创 2013-06-27 20:33:32 · 351 阅读 · 0 评论 -
LeetCode——Sudoku Solver
Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution.A sudoku原创 2013-07-01 13:56:19 · 945 阅读 · 0 评论 -
LeetCode——Count and Say
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read原创 2013-07-01 14:30:38 · 1078 阅读 · 0 评论 -
LeetCode——Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.»原创 2013-07-01 14:35:17 · 867 阅读 · 0 评论 -
LeetCode——Combination Sum
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C unlimited原创 2013-07-01 15:50:23 · 1519 阅读 · 0 评论 -
LeetCode——Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the c原创 2013-07-01 16:45:51 · 849 阅读 · 0 评论 -
LeetCode——Trapping Rain Water
Given n non-negative integers 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,原创 2013-07-03 16:45:33 · 1892 阅读 · 1 评论 -
LeetCode——Multiply Strings
Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.» Solve this problem利用竖式的思想,进行乘原创 2013-07-03 17:33:45 · 1140 阅读 · 0 评论