叶局长的博客

文章目录1. 问题描述2. my solution2.1 我的思路2.2 代码实现2.3 运行结果3. others solutions3.1 思路一(较差)3.1.1 基本步骤3.2 思路二(较好)1. 问题描述DescriptionGiven an array of integers, find the continuous subarray with smallest sum.Ret...

文章目录1. 问题描述2. my solution2.1 我的思路2.2 代码实现2.3 运行结果3. others solutions3.1 思路一(较好)1. 问题描述DescriptionGiven an array of integers, find a contiguous subarray which has the largest sum.The subarray shou...

文章目录1. 问题描述2. my solution2.1 我的思路2.2 代码实现2.3 运行结果3. others solutions3.1 思路一1. 问题描述2. my solution2.1 我的思路遍历数组, 找到分割数组的位置(前数字比后数字小)根据分割数组的位置来存放数据时间复杂度为O(n)2.2 代码实现class Solution {public: ...

文章目录1. 问题描述2. my solution2.1 我的思路2.2 代码实现2.3 运行结果1. 问题描述Given an array nums of integers and an int k, partition the array (i.e move the elements in “nums”) such that:All elements < k are moved ...

我的方法public class Solution { /** * @param nums: The integer array. * @param target: Target to find. * @return: The first position of target. Position starts from 0. */ pub...