leetcode
coolwriter
这个作者很懒,什么都没留下…
展开
-
Move Zeroes 移动零、Expression Add Operators 表达式增加操作符
1.Move Zeroes 移动零Given an arraynums, write a function to move all0's to the end of it while maintaining the relative order of the non-zero elements.For example, givennums = [0, 1, 0, 3, 12],...原创 2019-02-27 13:17:14 · 190 阅读 · 0 评论 -
leetcode word break
1.Word Break 拆分词句 Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictiona...原创 2019-02-22 13:32:10 · 284 阅读 · 0 评论 -
版本比较、One Edit Distance 一个编辑距离、Reverse Words in a String 翻转字符串中的单词、single number
1.Compare Version Numbers 版本比较 Compare two version numbers version1 and version2.If version1 > version2 return 1; if version1 <version2 return -1;otherwise return 0.You may assume that ...原创 2019-02-22 13:06:13 · 233 阅读 · 0 评论 -
leetcode 三角形
1.Triangle 三角形Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2],...原创 2019-02-21 21:07:41 · 390 阅读 · 0 评论 -
leetcode 简化路径、最小窗口子串、Word Search 词语搜索
1.Simplify Path 简化路径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.Co...原创 2019-02-21 17:09:40 · 269 阅读 · 0 评论 -
反转链表 II
LeetCode(92):反转链表 IIMedium!题目描述:反转从位置 m 到 n 的链表。请使用一趟扫描完成反转。说明:1 ≤ m ≤ n ≤ 链表长度。示例:输入: 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;NULL, m = 2, n = 4输出: 1-&gt;4-&gt;3-&gt;2-&gt;5-&gt原创 2019-02-02 15:46:32 · 175 阅读 · 0 评论 -
Palindrome
给了我们一个字符串,让我们找出可以组成的最长的回文串的长度,由于字符顺序可以打乱,所以问题就转化为了求偶数个字符的个数,class Solution {public: int longestPalindrome(string s) { int odds = 0; for (char c = 'A'; c <= 'z'; ++c) { ...原创 2018-07-14 22:23:58 · 227 阅读 · 0 评论 -
[LeetCode] Best Time to Buy and Sell Stock 买卖股票的最佳时间
Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), d...原创 2018-04-17 16:10:31 · 206 阅读 · 0 评论 -
[LeetCode] Longest Substring Without Repeating Characters 最长无重复子串
这道求最长无重复子串的题和之前那道 Isomorphic Strings 同构字符串很类似,我们还是建立一个256位大小的整型数组来代替哈希表,这样做的原因是ASCII表共能表示256个字符,所以可以记录所有字符,然后我们需要定义两个变量res和left,其中res用来记录最长无重复子串的长度,left指向该无重复子串左边的起始位置,然后我们遍历整个字符串,对于每一个遍历到的字符,如果哈希表中该字...原创 2018-04-11 15:46:13 · 142 阅读 · 0 评论 -
[LeetCode] Word Break II 拆分词句之二
[LeetCode] Word Break II 拆分词句之二Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Return all such possible sentence...原创 2018-04-16 21:19:25 · 237 阅读 · 0 评论 -
max-points-on-a-line(穿过点最多的直线)
题目描述Given n points on a 2D plane, find the maximum number of points that lie on the same straight line./** * Definition for a point. * struct Point { * int x; * int y; * Point()...原创 2018-04-16 15:50:11 · 454 阅读 · 0 评论 -
[leetcode]evaluate-reverse-polish-notation
Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are+,-,*,/. Each operand may be an integer or another expression. Some examples: ["2", "1", "+", "3", ...原创 2018-04-16 15:00:41 · 129 阅读 · 0 评论 -
leetcode(一)
1.Two Sum 两数之和 Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may ...原创 2019-02-18 21:00:07 · 164 阅读 · 0 评论 -
leetcode(二)
1.翻转整数Example1: x = 123, return 321Example2: x = -123, return -321class Solution {public: int reverse(int x) { long long res = 0; bool isPositive = true; if (x < ...原创 2019-02-18 21:05:43 · 139 阅读 · 0 评论 -
螺旋矩阵
1.生成矩阵class Solution {public: vector<vector<int> > creatMatrix(int n) { vector<vector<int> > mat(n, vector<int>(n, 0)); int val = 1; if (n <= 0) return ...原创 2019-02-18 21:15:19 · 256 阅读 · 0 评论 -
Word Pattern 词语模式
Word Pattern 词语模式Given apatternand a stringstr, find ifstrfollows the same pattern.Examples:pattern ="abba", str ="dog cat cat dog"should return true. pattern ="abba", str ="dog cat c...原创 2019-02-27 12:55:01 · 303 阅读 · 0 评论 -
Bulls and Cows 公母牛游戏
1.Bulls and Cows 公母牛游戏 You are playing the following Bulls and Cows game with your friend: You write a 4-digit secret number and ask your friend to guess it, each time your friend guesses a number...原创 2019-02-27 11:09:21 · 547 阅读 · 0 评论 -
leetcode First Missing Positive 首个缺失的正数,交换系列
1.leetcode First Missing Positive 首个缺失的正数Given an unsorted integer array, find the smallest missingpositive integer.Example 1:Input: [1,2,0]Output: 3Example 2:Input: [3,4,-1,1]Output: ...原创 2019-02-20 22:00:41 · 330 阅读 · 0 评论 -
leetcode 二分法、LRU Cache、Clone Graph 无向图的复制
1.搜索一个范围 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 n...原创 2019-02-26 14:36:21 · 221 阅读 · 0 评论 -
leetcode之 median of two sorted arrays
此题一开始我采用最笨的方法去实现,利用排序将两个数组合并成一个数组,然后返回中位数:class Solution {public: double findMedianSortedArrays(int A[], int m, int B[], int n) { // Start typing your C/C++ solution below // D...原创 2019-02-20 17:01:05 · 123 阅读 · 0 评论 -
leetcode DFS搜索
1.包围区域Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.For example,X X X XX O O X...原创 2019-02-20 11:28:27 · 146 阅读 · 0 评论 -
leetcode 链表
1.Reorder List 链表重排序Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You may not modify the values in the list's nodes, only nodes itself may be changed.Examp...原创 2019-02-19 21:51:11 · 144 阅读 · 0 评论 -
leetcode 二叉树路径和 path sum
1.Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and s...原创 2019-02-19 11:18:35 · 467 阅读 · 0 评论 -
leetcode子集合,数组之和
1.子集合Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order. The solution set must not contain duplicate subsets.For example...原创 2019-02-18 21:55:24 · 366 阅读 · 0 评论 -
leetcode(四)
1.sqrt 求开方class Solution {public: int mySqrt(int x) { if (x <= 1) return x; int res; int left = 0, right = x/2; while (left <= right) { int mi...原创 2019-02-18 21:46:31 · 153 阅读 · 0 评论 -
leetcode(三)
1.Pow(x, n) 求x的n次方class Solution {public: double myPow(double x, int n) { if (n == 0) return 1; double half = myPow(x, n / 2); if (n % 2 == 0) return half * half;...原创 2019-02-18 21:25:34 · 149 阅读 · 0 评论 -
29. Divide Two Integers
Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT. 题目的意思是两数除法,但不使用乘法,除法,取模等运算符来做。 回想除法的最朴素思想: 即,当 被除数>除数 一直拿被除数减去除数,能减去除数的次数为两数相除的结果原创 2018-01-18 15:46:58 · 150 阅读 · 0 评论 -
26. 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 by modifying th原创 2018-01-18 11:05:36 · 148 阅读 · 0 评论 -
二叉树preorderTraversal
Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3]. Note: Recursive solution is trivial,原创 2018-01-04 17:06:29 · 597 阅读 · 0 评论 -
binary-tree-postorder-traversal
Given a binary tree, return the postorder traversal of its nodes’ values. For example: Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1]. Note: Recursive solution is trivial原创 2018-01-04 16:35:22 · 190 阅读 · 0 评论 -
sort-list(不限空间)
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *ins原创 2018-01-04 16:03:44 · 222 阅读 · 0 评论 -
sort-list
从中间分开,归并排序class Solution {public: ListNode* sortList(ListNode *head) { if(head == NULL || head -> next == NULL){ return head; } else{ ListNode *fast = head,原创 2018-01-04 15:09:22 · 187 阅读 · 0 评论 -
链表A+B
/*struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) {}};*/class Plus {public: ListNode* plusAB(ListNode* a, ListNode* b) { ListNode* he原创 2018-01-21 13:29:36 · 288 阅读 · 0 评论 -
139. Word Break
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. You may assu原创 2018-01-12 17:30:33 · 175 阅读 · 0 评论 -
28. Implement strStr()
字符串中第一次出现给定字符串的位置class Solution {public: int strStr(string haystack, string needle) { if (needle.empty()) return 0; int m = haystack.size(), n = needle.size(); if (m <...原创 2018-01-12 16:18:19 · 217 阅读 · 0 评论 -
Longest Common Prefix 公共子串
Write a function to find the longest common prefix string amongst an array of strings.“abcdefg” “abcdefghijk” “abcdfghijk” “abcef”上面的字符串数组的最长公共前缀就是”abc”。class Solution {public: string lo原创 2018-01-12 11:18:52 · 157 阅读 · 0 评论 -
Sqrt(x) 二分法和牛顿法求开平方
求一个整数的平方根,如果该整数的平方根不是整数的话,返回平方根取整。二分搜索,开始区间是1,终止区间是x。class Solution {public: int mySqrt(int x) { if(x 0) return 0; if(x == 1) return 1; int b原创 2018-01-11 17:20:44 · 1593 阅读 · 0 评论 -
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: The solution set must not contain d原创 2018-01-05 16:04:07 · 233 阅读 · 0 评论 -
排序数组去重
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 by modifying th原创 2018-01-11 13:04:46 · 362 阅读 · 0 评论 -
链表reorder
Given a singly linked list L: L 0→L 1→…→L n-1→L n, reorder it to: L 0→L n →L 1→L n-1→L 2→L n-2→… You must do this in-place without altering the nodes’ values. For example, Given{1,2,3,4}, reorder i原创 2018-01-04 17:30:36 · 249 阅读 · 0 评论