数组和字符串
一. 求数组中心索引:
class Solution {
public int pivotIndex(int[] nums) {
int total = Arrays.stream(nums).sum();
int sum = 0;
for (int i = 0; i < nums.length; ++i) {
if (2 * sum + nums[i] == total) {
return i;
}
sum += nums[i];
}
return -1;
}
}
作者:LeetCode-Solution
链接:https://leetcode.cn/problems/find-pivot-index/solution/xun-zhao-shu-zu-de-zhong-xin-suo-yin-by-gzjle/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
搜索插入位置
class Solution {
public int searchInsert(int[] nums, int target) {
for(int i=0;i<nums.length;i++){
if(nums[i]>=target) return i;
}
return nums.length;
}
}
合并区间
class Solution {
public int[][] merge(int[][] intervals) {
if(intervals.length==0){
return intervals;
}
Arrays.sort(intervals, (a, b) -> a[0] - b[0]);
List<int[]> list = new ArrayList<>();
int terms[] = intervals[0];
for(int i=1;i<intervals.length;i++){
if(terms[1]>=intervals[i][0]){
terms[1] = Math.max(intervals[i][1],terms[1]);
}else{
list.add(terms);
terms=intervals[i];
}
}
list.add(terms);
return list.toArray(new int[list.size()][2]);
}
}