Touchig的博客

问题描述原题链接 Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]….Example: (1) Given nums = [1, 5, 1, 1, 6, 4], one possible answer is [1, 4, 1, 5, 1, 6]. (2) Given

问题描述Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2.Note: The length of both num1 and num2 is < 110. Both num1 and num2 contains only digits

LeetCode Problem 424: Longest-Repeating-Character-Replacement问题描述Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k t

问题描述Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1...

一种重新映射坐标，收缩空间的解法原题链接：Escape a Large Maze参考自 @qb_2008 发布于讨论区的帖子代码：class Solution { void gen_map(map<int, int>& a, int x) { if (x > 0) a[x-1] = 0; a[x] = 0; ...