摘要:
class Solution { public int searchInsert(int[] nums, int target) { int index = 0; if (nums[0] > target) { index = 0; } if (nums[nums.length - 1] < tar 阅读全文
摘要:
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 阅读全文