关注
分享
记录运用算法，数据结构，字符串处理等基础编程知识的成长历程，题源正是来自知名的“coding interviews” --------LeetCode。本专题使用的是C++提交的AC码。
EbowTang
linux，windows，服务器，存储，云计算，云原生，网络，python，C++，shell，数据库，SQL，PLSQL，运维
展开
-
<LeetCode OJ> 389. Find the Difference
Given two strings s and t which consist of only lowercase letters.String t is generated by random shuffling string s and then add one more letter at a random position.Find the letter that was原创 2016-08-31 19:54:27 · 1452 阅读 · 0 评论 -
<LeetCode OJ> 75. Sort Color
题目翻译：给定一个具有N个元素的数组，且数组只存在三种值0,1,2，分别代表红色，白色或蓝色。现在对其排序，使得相同颜色的物体是相邻的，要求顺序为红、白、蓝。提醒你是不是想利用图书馆的排序解决这个问题。更进一步：一个相当简单的解决方案是使用计数排序算法。首先，迭代数组统计0的，1的，2的个数，然后将0覆盖指定个数的到数组，然后1，其次是2。你能想出一个一原创 2016-01-15 22:02:59 · 1206 阅读 · 0 评论 -
<LeetCode OJ> 382. Linked List Random Node
Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen.Follow up:What if the linked list is extremely large and i原创 2016-08-11 23:58:56 · 1709 阅读 · 0 评论 -
<LeetCode OJ> 387. First Unique Character in a String
Total Accepted: 4516 Total Submissions: 10603 Difficulty: EasyGiven a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.Examples:s原创 2016-08-24 21:43:34 · 1685 阅读 · 0 评论 -
<LeetCode OJ> 383. Ransom Note
Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constru原创 2016-08-11 23:36:06 · 3252 阅读 · 0 评论 -
<LeetCode OJ> 374. Guess Number Higher or Lower
We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I'll tell you whether the number is higher原创 2016-07-14 21:16:35 · 2614 阅读 · 0 评论 -
<LeetCode OJ> 371. Sum of Two Integers
Total Accepted: 3722 Total Submissions: 6898 Difficulty: EasyCalculate the sum of two integers a and b, but you are not allowed to use the operator + and -.Example:Given a = 1 and b =原创 2016-07-02 18:25:10 · 1816 阅读 · 0 评论 -
<LeetCode OJ> 241. Different Ways to Add Parentheses
Total Accepted: 23674 Total Submissions: 65569 Difficulty: MediumGiven a string of numbers and operators, return all possible results from computing all the different possible ways to grou原创 2016-06-16 09:16:57 · 1966 阅读 · 0 评论 -
<LeetCode OJ> 334. Increasing Triplet Subsequence
Total Accepted: 16003 Total Submissions: 46481 Difficulty: MediumGiven an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.Formally the func原创 2016-06-14 20:20:17 · 1082 阅读 · 0 评论 -
<LeetCode OJ> 318. Maximum Product of Word Lengths
Total Accepted: 23617 Total Submissions: 58995 Difficulty: MediumGiven a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share原创 2016-06-13 20:31:51 · 2463 阅读 · 0 评论 -
<LeetCode OJ> 173. Binary Search Tree Iterator
Total Accepted: 50775 Total Submissions: 144066 Difficulty: MediumImplement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Cal原创 2016-06-13 19:35:59 · 1113 阅读 · 0 评论 -
<LeetCode OJ> 357. Count Numbers with Unique Digits
Total Accepted: 450 Total Submissions: 1077 Difficulty: MediumGiven a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n.Example:Given n = 2, return 91. (Th原创 2016-06-13 17:26:10 · 1576 阅读 · 0 评论 -
<LeetCode OJ> 60. Permutation Sequence
Total Accepted: 56468 Total Submissions: 221337 Difficulty: MediumThe set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in orde原创 2016-06-12 22:57:23 · 1330 阅读 · 0 评论 -
<LeetCode OJ> 114. Flatten Binary Tree to Linked List
Total Accepted: 84864 Total Submissions: 270352 Difficulty: MediumGiven a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5原创 2016-06-12 17:57:40 · 1321 阅读 · 0 评论 -
<LeetCode OJ> 201. Bitwise AND of Numbers Range
Total Accepted: 35859 Total Submissions: 115817 Difficulty: MediumGiven a range [m, n] where 0 For example, given the range [5, 7], you should return 4.Credits:Special thanks to @amr原创 2016-06-12 11:06:00 · 1088 阅读 · 0 评论 -
<LeetCode OJ> 200 / 130 Number of Islands / Surrounded Regions
Total Accepted: 48411 Total Submissions: 171609 Difficulty: MediumGiven a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and原创 2016-06-11 16:36:36 · 1418 阅读 · 0 评论 -
<LeetCode OJ> 48. Rotate Image
Total Accepted: 69879 Total Submissions: 199786 Difficulty: MediumYou are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could yo原创 2016-06-05 16:27:07 · 2163 阅读 · 0 评论 -
<LeetCode OJ> 54 / 59 Spiral Matrix( I / II )
Total Accepted: 61182 Total Submissions: 268396 Difficulty: MediumGiven a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Gi原创 2016-06-04 18:05:45 · 1194 阅读 · 0 评论 -
<LeetCode OJ> 106. Construct Binary Tree from Inorder and Postorder Traversal
Total Accepted: 56569 Total Submissions: 193357 Difficulty: MediumGiven inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not原创 2016-06-03 22:43:25 · 1100 阅读 · 0 评论 -
<LeetCode OJ> 105. Construct Binary Tree from Preorder and Inorder Traversal
Total Accepted: 65143 Total Submissions: 224882 Difficulty: MediumGiven preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not e原创 2016-06-03 18:08:36 · 1293 阅读 · 0 评论 -
<LeetCode OJ> 109 / 108 Convert Sorted ( List / Array ) to Binary Search Tree
Total Accepted: 71642 Total Submissions: 233074 Difficulty: MediumGiven a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.Subscri原创 2016-06-02 21:48:27 · 1085 阅读 · 0 评论 -
LeetCode总结，回溯法小结
一，回溯法思想回溯法概念 回溯算法实际上一个类似枚举的搜索尝试过程，主要是在搜索尝试过程中寻找问题的解，当发现已不满足求解条件时，就“回溯”返回，尝试别的路径。 回溯法是一种选优搜索法，按选优条件向前搜索，以达到目标。但当探索到某一步时，发现原先选择并不优或达不到目标，就退回一步重新选择，这种走不通就退回再走的技术为回溯法，而满足回溯条件的某个状态原创 2016-06-02 21:31:15 · 16870 阅读 · 2 评论 -
<LeetCode OJ> 319. Bulb Switcher
Total Accepted: 20000 Total Submissions: 48830 Difficulty: MediumThere are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the thi原创 2016-06-02 09:00:07 · 1076 阅读 · 0 评论 -
<LeetCode OJ> 223. Rectangle Area
Total Accepted: 38216 Total Submissions: 126941 Difficulty: EasyFind the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corne原创 2016-05-31 15:57:41 · 1060 阅读 · 0 评论 -
LeetCode总结，二叉树各种类型问题小结
1,三大基础遍历方式三个遍历的博客地址，1）<LeetCode OJ> 144/145/94 Binary Tree （Pre & In & Post） order Traversal即：前序遍历，总是先访问当前节点，再左子，最后右子中序遍历，总是先访问左子，再当前节点，最后右子后序遍历，总是先访问左子，再右子，最后当前节点关于三原创 2016-05-24 10:49:23 · 5899 阅读 · 1 评论 -
<LeetCode OJ> 349 / 350 Intersection of Two Arrays（I / II）
Total Accepted: 3212 Total Submissions: 6814 Difficulty: EasyGiven two arrays, write a function to compute their intersection.Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], retu原创 2016-05-20 00:07:47 · 2187 阅读 · 1 评论 -
<LeetCode OJ> 61 / 86 Rotate List / Partition List
Total Accepted: 69038 Total Submissions: 300765 Difficulty: MediumGiven a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL原创 2016-05-16 09:13:21 · 1085 阅读 · 0 评论 -
<LeetCode OJ> 347. Top K Frequent Elements
Total Accepted: 2605 Total Submissions: 5933 Difficulty: MediumGiven a non-empty array of integers, return the k most frequent elements.For example,Given [1,1,1,2,2,3] and k = 2, retur原创 2016-05-04 18:31:59 · 3130 阅读 · 2 评论 -
<LeetCode OJ> 160. Intersection of Two Linked Lists
Total Accepted: 72363 Total Submissions: 239177 Difficulty: EasyWrite a program to find the node at which the intersection of two singly linked lists begins.For example, the following原创 2016-05-01 23:24:43 · 4544 阅读 · 2 评论 -
<LeetCode OJ> 89. Gray Code
Total Accepted: 59678 Total Submissions: 164093 Difficulty: MediumThe gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer原创 2016-05-01 14:39:06 · 1788 阅读 · 0 评论 -
LeetCode总结，位运算总结
对于位运算面试问题，其实我觉得是最不好处理的一类问题，原因在于他的技巧性和规律性太强，往往需要根据若干种基本运算规则（见下面）及其组合达到特定目的运算，难就难在技巧性。本文罗列了几种常见的位运算面试问题。一，位运算基础知识C++中位运算基本符号：~ | & ^ > ! 其中 ！和 ~ 是不同的。基本的位操作符有与、或、非，异或、同或、取反原创 2016-04-23 23:01:04 · 3597 阅读 · 0 评论 -
<LeetCode OJ> 345 / 344 Reverse Vowels of a String / Reverse String
Total Accepted: 537 Total Submissions: 1488 Difficulty: EasyWrite a function that takes a string as input and reverse only the vowels of a string.Example 1:Given s = "hello", return "h原创 2016-04-23 20:35:46 · 5172 阅读 · 0 评论 -
<LeetCode OJ> 343. Integer Break
Total Accepted: 2481 Total Submissions: 5881 Difficulty: MediumGiven a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integer原创 2016-04-21 17:11:47 · 1992 阅读 · 0 评论 -
<LeetCode OJ> 338. Counting Bits
Total Accepted: 7119 Total Submissions: 12947 Difficulty: MediumGiven a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their原创 2016-03-26 12:12:37 · 1263 阅读 · 0 评论 -
<LeetCode OJ> 337. House Robber III
Total Accepted: 1341 Total Submissions: 3744 Difficulty: MediumThe thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." B原创 2016-03-14 23:41:39 · 2429 阅读 · 3 评论 -
<LeetCode OJ> 39 / 40 / 216 Combination Sum(I / II / III)
Total Accepted: 83289 Total Submissions: 274461 Difficulty: MediumGiven a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numb原创 2016-03-11 09:11:42 · 1592 阅读 · 0 评论 -
<LeetCode OJ> 274 / 275 H-Index(I / II)
Total Accepted: 37719 Total Submissions: 125936 Difficulty: MediumGiven an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the res原创 2016-03-10 20:17:19 · 1314 阅读 · 0 评论 -
<LeetCode OJ> 78 / 90 Subsets (I / II)
Total Accepted: 87879 Total Submissions: 285264 Difficulty: MediumGiven a set of distinct integers, nums, return all possible subsets.Note:Elements in a subset must be in non-desce原创 2016-03-10 11:24:30 · 1791 阅读 · 2 评论 -
<LeetCode OJ> 77. Combinations
Total Accepted: 69360 Total Submissions: 206274 Difficulty: MediumGiven two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k =原创 2016-03-09 15:35:14 · 2919 阅读 · 3 评论 -
<LeetCode OJ> 73. Set Matrix Zeroes
Total Accepted: 60832 Total Submissions: 184016 Difficulty: MediumGiven a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.F原创 2016-03-07 20:14:45 · 2099 阅读 · 0 评论