随笔分类 -  闲来无事

摘要:Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: No 阅读全文
posted @ 2019-01-29 12:08 TobicYAL 阅读(157) 评论(0) 推荐(0)
摘要:Given a linked list, remove the n-th node from the end of list and return its head. Example: Note: Given n will always be valid. Follow up: Could you 阅读全文
posted @ 2019-01-29 12:00 TobicYAL 阅读(154) 评论(0) 推荐(0)
摘要:Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique q 阅读全文
posted @ 2019-01-29 11:37 TobicYAL 阅读(800) 评论(0) 推荐(0)
摘要:Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. A mapping of digit to le 阅读全文
posted @ 2019-01-26 11:53 TobicYAL 阅读(137) 评论(0) 推荐(0)
摘要:Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the thr 阅读全文
posted @ 2019-01-26 11:32 TobicYAL 阅读(175) 评论(0) 推荐(0)
摘要:Given an array nums of n integers, are there elements a, b, c in nums such that a+ b + c = 0? Find all unique triplets in the array which gives the su 阅读全文
posted @ 2019-01-26 10:49 TobicYAL 阅读(178) 评论(0) 推荐(0)
摘要:Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Exampl 阅读全文
posted @ 2019-01-26 09:44 TobicYAL 阅读(186) 评论(0) 推荐(0)
摘要:Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For example, two is written as II in Roman numeral, just two one's 阅读全文
posted @ 2019-01-26 09:32 TobicYAL 阅读(151) 评论(0) 推荐(0)
摘要:Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For example, two is written as II in Roman numeral, just two one's 阅读全文
posted @ 2019-01-26 09:21 TobicYAL 阅读(138) 评论(0) 推荐(0)
摘要: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 endp 阅读全文
posted @ 2019-01-25 15:24 TobicYAL 阅读(164) 评论(0) 推荐(0)
摘要:Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'. The matching should cover the entire  阅读全文
posted @ 2019-01-25 13:35 TobicYAL 阅读(258) 评论(0) 推荐(0)
摘要:Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Example 1: Example 2: Example 3: 阅读全文
posted @ 2019-01-25 10:51 TobicYAL 阅读(148) 评论(0) 推荐(0)
摘要:Implement atoi which converts a string to an integer. The function first discards as many whitespace characters as necessary until the first non-white 阅读全文
posted @ 2019-01-25 10:45 TobicYAL 阅读(166) 评论(0) 推荐(0)
摘要:Problem A. Mushroom Monster Problem Kaylin loves mushrooms. Put them on her plate and she'll eat them up! In this problem she's eating a plate of mush 阅读全文
posted @ 2019-01-23 20:07 TobicYAL 阅读(235) 评论(0) 推荐(0)
摘要:Problem A. Standing Ovation Problem It's opening night at the opera, and your friend is the prima donna (the lead female singer). You will not be in t 阅读全文
posted @ 2019-01-23 11:36 TobicYAL 阅读(245) 评论(0) 推荐(0)
摘要:Easy Given a 32-bit signed integer, reverse digits of an integer. Example 1: Example 2: Example 3: Note:Assume we are dealing with an environment whic 阅读全文
posted @ 2019-01-20 15:31 TobicYAL 阅读(132) 评论(0) 推荐(0)
摘要:Medium 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 fixe 阅读全文
posted @ 2019-01-20 15:17 TobicYAL 阅读(190) 评论(0) 推荐(0)
摘要:Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Example 2: 1 class Solu 阅读全文
posted @ 2019-01-20 13:58 TobicYAL 阅读(138) 评论(0) 推荐(0)
摘要:There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity sh 阅读全文
posted @ 2019-01-19 11:44 TobicYAL 阅读(165) 评论(0) 推荐(0)
摘要:Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer 阅读全文
posted @ 2019-01-11 15:06 TobicYAL 阅读(139) 评论(0) 推荐(0)