pkufergus的专栏

class Solution {public: int jump(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function int *dist = new int[n+1];dist[n - 1] = 0;int *next = new int[n+1];next[

struct TwoSum{ public: TwoSum(int idx1, int idx2, int v) : index1(idx1), index2(idx2), value(v) {} public: int index1; int index2; int value; }; struct increaing { bool op

class Solution { public: string convert(string s, int nRows) { if (nRows < 2) return s; int N = s.size(); int L = 2 * (nRows - 1); // provide offset string res;

class Solution { public: int atoi(const char *str) { // Start typing your C/C++ solution below // DO NOT write int main() function if (str == NU

//============================================================================ // Roman to Integer // Given a roman numeral, convert it to an integer. // // Input is guaranteed to be within the range

class Solution { public: int reverse(int x) { // Start typing your C/C++ solution below // DO NOT write int main() function int ret; int sign = (x < 0); if

class Solution { public: bool isPalindrome(int x) { if (x < 0) return false; int d = 1; while (x / d >= 10) d *= 10; while (x != 0) { int l = x / d;

class Solution { public: double findKth(int A[], int m, int B[], int n, int k) { //m is equal or smaller than n if (m > n) return findKth(B, n, A, m, k); if

class Solution { public: int lengthOfLongestSubstring(string s) { // Start typing your C/C++ solution below // DO NOT write int main() function int locs[256];//保存字符上一次出现的位置

class Solution { public: string longestCommonPrefix(vector &strs) { int N = strs.size(); if (N == 0) return ""; int l = 0; while (l < strs[0].size()) {

class Solution { public: int min(int a, int b){ if (a < b) { return a; } else { return b; } } int max(int a, int b){ if (a > b) {

class Solution { public: ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) { // Start typing your C/C++ solution below // DO NOT write int main() function ListNode *head; if (l1 == NU

class Solution { public: int threeSumClosest(vector &num, int target) { int N = num.size(); sort(num.begin(), num.end()); int res = num[0] + num[1] + num[2]; for (i

//============================================================================ // Given an integer, convert it to a roman numeral. // // Input is guaranteed to be within the range from 1 to 3999. //==

The n-queens puzzle is the problem of placing n queens on an n�n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens pu

Follow up for N-Queens problem. Now, instead outputting board configurations, return the total number of distinct solutions. class Solution { public: void backtrace(int &ans, vector &board, int

The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, We get the following sequence (ie, for n = 3): "123" "132" "213"

题目： Given an array of strings, return all groups of strings that are anagrams. Note: All inputs will be in lower-case. class Node{ public: vector bit; int len; int index; int oper

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted from left to right.The first integer of each

Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example, S = "ADOBECODEBANC" T = "ABC" Minimum window is "BAN

Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified. You should pack your words in a greedy approach; that i

Given an absolute path for a file (Unix-style), simplify it. For example, path = "/home/", => "/home" path = "/a/./b/../../c/", => "/c" click to show corner cases. Corner Cases: Did

class Solution { public: bool isMatch(const char *s, const char *p) { if (*p == '\0') return *s == '\0'; if (*(p+1) != '*') { return ((*p == *s) || (*p == '.' && *s !=

class Solution { public: string longestPalindrome(string s) { // Start typing your C/C++ solution below // DO NOT write int main() function int i, j; int left, right; int max; int

class Solution { public: vector > threeSum(vector &num) { // Start typing your C/C++ solution below // DO NOT write int main() function //map > hashmap; map hashneg; map hashpos;