Leetcode
每天一道leetcode : )
从舟
这个作者很懒,什么都没留下…
展开
-
033. Search in Rotated Sorted Array [Medium][未通过]
class Solution {public: int search(vector<int>& nums, int target) { int l = 0, r = nums.size() - 1; while (l <= r) { int mid = (l + r) / 2; if (nums[mid] == target) return mid; if ...原创 2020-03-24 20:16:52 · 66 阅读 · 0 评论 -
2. Add Two Numbers[学习指针用法]
class Solution {public: ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { ListNode *h = new ListNode(0); ListNode *p = h; int temp = 0; while(l1 != NULL && l2 != NULL) { p->next ...原创 2020-03-23 14:31:39 · 240 阅读 · 0 评论 -
015.3Sum / 016.3Sum Closest / 018. 4Sum【同类型】
参考柳神代码:class Solution {public:vector<vector<int>> threeSum(vector<int>& nums) {vector<vector<int>> result;int n = nums.size();if(n < 3) return result;sort(n...原创 2020-03-22 11:04:49 · 96 阅读 · 0 评论 -
012. Integer to Roman [Medium]
class Solution {public:string intToRoman(int num) {string result = "";int a[] = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4,1};string b[] = {"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X...原创 2020-03-22 09:04:05 · 79 阅读 · 0 评论 -
011. Container With Most Water [Medium]
题目:Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). nvertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find tw...原创 2020-03-21 16:58:41 · 82 阅读 · 0 评论 -
03. Longest Substring Without Repeating Characters [Medium]
参考柳神代码class Solution {public:int lengthOfLongestSubstring(string s) {int i = 0, j = 0, len = s.length();int maxlen = 0;int book[256] = {0}; //标记数组 判断重复while(j < len) { ...原创 2020-03-21 16:20:08 · 70 阅读 · 0 评论 -
[Dynamic Programming]005. Longest Palindromic Substring [Medium]
//借鉴柳神代码class Solution {public: string longestPalindrome(string s) { int len=s.length(); if(len == 0)return ""; string result=s.substr(0,1); for(int i=0;i<=len-2;i++){ ...原创 2020-03-18 09:15:56 · 93 阅读 · 0 评论