05 2015 档案
摘要：A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk su
阅读全文
摘要：Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. Example
阅读全文
摘要：Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the
阅读全文
摘要：Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be
阅读全文
摘要：在使用C++的STL时，经常会用到迭代器，那么不得不搞清楚里面的一些指针 begin(), end(), rbegin(), rend()之间的区别与联系，以及它们分别都指向哪个元素。首先要明白的一点是它们都是指针，其中begin()指向第一个元素，我们容易误认为end()是指向最后一个元素，其实不...
阅读全文
摘要：Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the arr...
阅读全文
摘要：A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are give
阅读全文
摘要：在Qt中我们有时需要让一个控件在窗口居中或是在父控件中居中，而且在窗口拉伸时仍然保持正中央的位置。这里介绍一种方法，用到了主窗口的响应函数resizeEvent(QResizeEvent* event)，这个响应函数在窗口的大小改变时会自动调用，该函数如下：void MainWindow::resi...
阅读全文
摘要：Given a string s, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can f
阅读全文
摘要：编号快捷键功能1Esc切换到代码编辑状态2F1查看帮助（选中某一类或函数，按下F1，出现帮助文档）3F2在光标选中对象的声明和定义之间切换（和Ctrl+鼠标左键一样的效果，选中某一类或函数，按下F2，迅速定位到该类或函数声明的地方或被调用的地方）4F3查找下一个5F4头文件和源文件之间切换6F5开始...
阅读全文
摘要：控件的sizePolicy说明控件在布局管理中的缩放方式。Qt提供的控件都有一个合理的缺省sizePolicy，但是这个缺省值有时不能适合 所有的布局，开发人员经常需要改变窗体上的某些控件的sizePolicy。一个QSizePolicy的所有变量对水平方向和垂直方向都适用。下面列举 了一些最长用的...
阅读全文
摘要：You are given a string s and an array of strings words. All the strings of words are of the same length. A concatenated substring in s is a substring
阅读全文
摘要：You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are ar
阅读全文
摘要：Given an m x n board of characters and a list of strings words, return all words on the board. Each word must be constructed from letters of sequentia
阅读全文
摘要：Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that: 0 <= a, b, c, d < n a
阅读全文
摘要：Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of t
阅读全文
摘要：Design a data structure that supports the following two operations: search(word) can search a literal word or a regular expression string containing o
阅读全文
摘要：Now compile your program withg++ -std=c++11 your_file.cpp -o main
阅读全文
摘要：There are a total of n courses you have to take, labeled from 0 to n-1. Some courses may have prerequisites, for example to take course 0 you have to
阅读全文
摘要：Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't
阅读全文
摘要：Implement a trie with insert, search, and startsWith methods. Example: Note: You may assume that all inputs are consist of lowercase letters a-z. All
阅读全文
摘要：In the C++ STL, the vector size() function return size_t, which is unsigned int, not int. So imagine this, define an empty vector v, and v.size() shou...
阅读全文
摘要：There are a total of n courses you have to take, labeled from 0 to n-1. Some courses may have prerequisites, for example to take course 0 you have to
阅读全文
摘要：Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k]
阅读全文
摘要：// Write data FileStorage fs("test.yml", FileStorage::WRITE); fs << "MyString" << "123abc"; fs.release(); // Read data FileStorage ...
阅读全文
摘要：Given a string s, find the length of the longest substring without repeating characters. Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The a
阅读全文
摘要：Reverse a singly linked list. Example: Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both? 之前做到 Reve
阅读全文
摘要：这个马拉车算法 Manacher‘s Algorithm 是用来查找一个字符串的最长回文子串的线性方法，由一个叫 Manacher 的人在 1975 年发明的，这个方法的最大贡献是在于将时间复杂度提升到了线性，这是非常了不起的。对于回文串想必大家都不陌生，就是正读反读都一样的字符串，比如 "bob"
阅读全文
