问题描述:
代码:
class Solution {
public boolean increasingTriplet(int[] nums) {
int one = Integer.MAX_VALUE,two = Integer.MAX_VALUE;
for(int three : nums){
if(three > two) return true;
else if(three <= one) one = three;
else two = three;
}
return false;
}
}
思路:
力扣https://leetcode-cn.com/problems/increasing-triplet-subsequence/solution/pou-xi-ben-zhi-yi-wen-bang-ni-kan-qing-t-3ye2/238. 除自身以外数组的乘积
问题描述:
代码:
class Solution {
public int[] productExceptSelf(int[] nums) {
int n=nums.length;
int []left=new int[n];
int []right=new int[n];
int []ans=new int[n];
left[0]=1;
right[n-1]=1;
for(int i=1;i<n;i++){
left[i]=nums[i-1]*left[i-1];
}
for(int j=n-2;j>=0;j--){
right[j]=nums[j+1]*right[j+1];
}
for(int p=0;p<n;p++){
ans[p]=left[p]*right[p];
}
return ans;
}
}
思路:
问题描述:
代码:
class Solution {
public int subarraySum(int[] nums, int k) {
int n=nums.length;
int count=0;
int sum=0;
for(int i=0;i<n;i++){
sum=0;
for(int j=i;j<n;j++){
sum+=nums[j];
if(sum==k)
{
count++;
}
}
}
return count;
}
}
思路: