Leetcode总结之Array
1.定义数组
String[] s=new String[6],定义一个长度为6的字符串数组
int[] i=new int[6],定义一个长度为6的整型数组
String[] str=new String[]{“a”,“b”,“c”},在定义的时候进行赋值
2.数组基本操作
数组长度:a.length(数组是.length; 字符串是.length())
3.leetcode例题
1. Two Sum
answer:
class Solution {
public int[] twoSum(int[] nums, int target) {
for(int i=0;i<nums.length;i++){
for(int j=i+1;j<nums.length;j++)
if(nums[i]+nums[j]==target){
return new int[]{i,j};
}
}
throw new IllegalArgumentException("No two sum solution");
}
}
26. Remove Duplicates from Sorted Array
answer:
class Solution {
public int removeDuplicates(int[] nums) {
int i=0;
if(nums.length==0){
return 0;
}
for(int j=1;j<nums.length;j++){
if(nums[i]!=nums[j]){
i++;
nums[i]=nums[j];
}
}
return i+1;
}
}
27. Remove Element
answer:
class Solution {
public int removeElement(int[] nums, int val) {
int i=0;
for(int j=0;j<nums.length;j++){
if(nums[j]!=val){
nums[i]=nums[j];
i++;
}
}
return i;
}
}
35. Search Insert Position
answer:
class Solution {
public int searchInsert(int[] nums, int target) {
if(nums.length==0){
return 0;
}
for(int i=0;i<nums.length;i++){
if(nums[i]==target){
return i;
}
}
for(int i=0;i<nums.length;i++){
if(target<nums[i]){
return i;
}
}
return nums.length;
}
}