Tribble-CSDN博客

原创 Leetcode Day13

151. 颠倒字符串中的单词【中等】https://leetcode-cn.com/problems/reverse-words-in-a-string/void reverse(char* s, int start, int end) { while (start < end) { char temp = s[start]; s[start++] = s[end]; s[end--] = temp; }}char * rever

2022-04-18 22:38:40 192

原创 Leetcode Day12

148. 排序链表【中等】https://leetcode-cn.com/problems/sort-list/class Solution {public: ListNode* sortList(ListNode* head) { return sortList(head, nullptr); } ListNode* sortList(ListNode* head, ListNode* tail) { if (head == nullptr)

2022-04-17 23:19:14 314

原创 Leetcode Day10

70. 爬楼梯【简单】https://leetcode-cn.com/problems/climbing-stairs/class Solution {public: int climbStairs(int n) { vector<int>dp(n+1, 0); dp[1] = 1; dp[0] = 1; for(int i=2; i<=n; i++) { dp[i] =

2022-04-15 23:58:18 274

原创 Leetcode day9

54. 螺旋矩阵【中等】https://leetcode-cn.com/problems/spiral-matrix/class Solution {public: vector<int> spiralOrder(vector<vector<int>>& matrix) { vector<int> ans; if(matrix.size()==0||matrix[0].size()==0)

2022-04-15 00:23:27 764

原创 Leetcode Day8

200. 岛屿数量【中等】https://leetcode-cn.com/problems/number-of-islands/class Solution {public: int ans=0; void dfs(int x, int y, vector<vector<char>>& grid) { if(x<0||y<0||x>=grid.size()||y>=grid[0].size())

2022-04-13 22:53:28 63

原创 Leetcode Day7

剑指 Offer 43. 1～n 整数中 1 出现的次数【困难】https://leetcode-cn.com/problems/1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof/class Solution {public: int countDigitOne(int n) { int low=0; int cur; int high=n; int num=1; int ans

2022-04-12 23:54:37 206

原创 Leetcode Day6

415. 字符串相加【简单】https://leetcode-cn.com/problems/add-strings/模拟class Solution {public: string addStrings(string num1, string num2) { int len1 = num1.size(); int len2 = num2.size(); int add=0; string ans=""; f

2022-04-11 20:16:30 56

原创 Leetcode day5

剑指 Offer 14- I. 剪绳子【中等】https://leetcode-cn.com/problems/jian-sheng-zi-lcof/dfsclass Solution {public: int ans=-1; void dfs(int cur, int n, int tmp, int last) { if(cur==n) { ans=max(ans,tmp); return;

2022-04-10 22:42:22 64

原创 Leetcode Day4

121买卖股票的最佳时机【简单】https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/简单dpclass Solution {public: int maxProfit(vector<int>& prices) { vector<int> dp(prices.size()+1, 10001); //dp[i]=i前最小的 int re

2022-04-09 22:41:34 694

原创 Leetcode Day3

1.两数之和【简单】https://leetcode-cn.com/problems/two-sum/哈希class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int,int> mp; for(int i=0; i<nums.size(); i++) {

2022-04-08 23:04:01 271

原创 Leetcode Day1

4.653.最大子数组和【简单】https://leetcode-cn.com/problems/maximum-subarray/贪心：如果一段的和小于0直接舍弃class Solution {public: int maxSubArray(vector<int>& nums) { int maxx = nums[0]; int sum = 0; for(int i=0; i<nums.size(); i++)

2022-04-06 20:39:37 59

hannahz1192的博客