06 2020 档案

【LeetCode】【数组和字符串】搜索插入位置
摘要：class Solution { public int searchInsert(int[] nums, int target) { int index = 0; if (nums[0] > target) { index = 0; } if (nums[nums.length - 1] < tar 阅读全文
posted @ 2020-06-05 00:04 sxchen2012 阅读(82) 评论(0) 推荐(0)
【LeetCode】【数组和字符串】寻找数组的中心索引
摘要：class Solution { public int pivotIndex(int[] nums) { int sumLeft = 0; int sum = 0; for (int i = 0; i < nums.length; i++) { sum += nums[i]; } for (int 阅读全文
posted @ 2020-06-04 23:47 sxchen2012 阅读(91) 评论(0) 推荐(0)