syn

Author: COKID

.vscode/settings.json

@@ -1,3 +1,6 @@
 {
-    "java.errors.incompleteClasspath.severity": "info"
+    "java.project.sourcePaths": [
+        "Java",
+        ""
+    ]
 }

Cmain.cpp

@@ -0,0 +1,9 @@
+#include<iostream>
+#include"1.Á½ÊýÖ®ºÍ.cpp"
+#include<vector> 
+using namespace std;
+int main(){
+    vector<int> a = {2,7,11,15};
+    vector<int> b= Solution().twoSum(a,9);
+    cout<<b[0]<<b[1]<<endl;
+}

Cpp/1.两数之和.cpp

@@ -0,0 +1,29 @@
+/*
+ * @lc app=leetcode.cn id=1 lang=cpp
+ *
+ * [1] 两数之和
+ */
+
+// @lc code=start
+#include<vector>
+#include<algorithm>
+using namespace std;
+
+class Solution {
+
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+        int i,j;
+        for(i=0;i<nums.size()-1;i++){
+            for(j=i+1;j<nums.size();j++){
+                if(nums[i]+nums[j]==target){
+                   return {i,j};
+                }
+            }
+        }
+        return {};
+    }
+};
+
+// @lc code=end
+

Gmain.go

@@ -0,0 +1,13 @@
+package main
+
+import (
+	"fmt"
+)
+
+func main() {
+	// a:=[]int{2,7,11,15}
+	fmt.Println(add(1,2))
+}
+func add(a int,b int) int {
+	return a+b
+}

Golang/1.两数之和.go

@@ -5,21 +5,18 @@
  */
 
 // @lc code=start
-package Golang
-// import (
-// 	"fmt"
-// )
 
-func TwoSum(nums []int, target int) []int {
-	for i := 0; i < len(nums)-1; i++ {
+func twoSum(nums []int, target int) []int {
+	for i, x := range nums {
 		for j := i + 1; j < len(nums); j++ {
-			if nums[i]+nums[j] == target {
+			if x+nums[j] == target {
 				return []int{i, j}
 			}
 		}
 	}
-	return []int{}
+	return nil
 }
+
 // func main()  {
 // 	a:=[]int{2,7,11,15}
 // 	fmt.Println(twoSum(a,9))

Golang/15.三数之和.go

@@ -0,0 +1,42 @@
+/*
+ * @lc app=leetcode.cn id=15 lang=golang
+ *
+ * [15] 三数之和
+ */
+
+// @lc code=start
+import "sort"
+
+func threeSum(nums []int) [][]int {
+	sort.Ints(nums)
+	var result [][]int
+	for i:=0; i<len(nums); i++{
+		if i != 0&&nums[i]==nums[i-1] {
+			continue
+		}
+		var j,k = i+1,len(nums)-1
+		for j<k{
+			var sum=nums[i]+nums[j]+nums[k]
+			if sum==0 {
+				var temp =[]int{nums[i],nums[j],nums[k]}
+				result = append(result,temp)
+			}
+			if sum <= 0 {
+				j++
+				for j<k&&nums[j]==nums[j-1]{
+					j++
+				}
+			}
+			if sum >= 0 {
+				k--
+				for j<k&&nums[k]==nums[k+1]{
+					k--
+				}
+			}
+		}
+
+	}
+	return result
+}
+// @lc code=end
+

Golang/3.无重复字符的最长子串.go

@@ -0,0 +1,12 @@
+/*
+ * @lc app=leetcode.cn id=3 lang=golang
+ *
+ * [3] 无重复字符的最长子串
+ */
+
+// @lc code=start
+func lengthOfLongestSubstring(s string) int {
+
+}
+// @lc code=end
+

JMain.class

@@ -0,0 +1,51 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+public class JMain {
+    public static void main(String[] args) {
+        JSolution jsolution= new JSolution();
+
+        int []nums={2,2,2,2,2};
+        int target=8;
+        String s="23";
+        System.out.println(jsolution.fourSum(nums,target));
+    }
+}
+
+class ListNode {
+    int val;
+    ListNode next;
+    ListNode() {}
+    ListNode(int val) { this.val = val; }
+    ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+}
+
+class JSolution {
+
+    public ListNode removeNthFromEnd(ListNode head, int n) {
+        ArrayList<ListNode> list= new ArrayList<ListNode>();
+        ListNode t=head;
+       
+        while(t!=null){
+            list.add(t);
+            t=t.next;
+        }
+        int listLen= list.size();
+        if(n==listLen){
+            return list.get(1);
+            
+        }else if(n==1){
+            t=list.get(listLen-n-1);
+            t.next=null;
+            return head;
+        }else{
+            t = list.get(listLen-n-1);
+            t.next=list.get(listLen-n).next;
+            return head;
+        }
+    }
+    
+}

JMain.java

@@ -1,5 +1,3 @@
-import com.sun.corba.se.spi.orbutil.fsm.Guard.Result;
-
 /*
  * @lc app=leetcode.cn id=14 lang=java
  *

JSolution.class

@@ -5,26 +5,6 @@
  *
  * https://leetcode-cn.com/problems/3sum/description/
  *
- * algorithms
- * Medium (19.46%)
- * Total Accepted:    39K
- * Total Submissions: 184.1K
- * Testcase Example:  '[-1,0,1,2,-1,-4]'
- *
- * 给定一个包含 n 个整数的数组 nums，判断 nums 中是否存在三个元素 a，b，c ，使得 a + b + c = 0
- * ？找出所有满足条件且不重复的三元组。
- * 
- * 注意：答案中不可以包含重复的三元组。
- * 
- * 例如, 给定数组 nums = [-1, 0, 1, 2, -1, -4]，
- * 
- * 满足要求的三元组集合为：
- * [
- * ⁠ [-1, 0, 1],
- * ⁠ [-1, -1, 2]
- * ]
- * 
- * 
  */
 import java.util.ArrayList;
 import java.util.Arrays;

Java/14.最长公共前缀.java

@@ -0,0 +1,36 @@
+/*
+ * @lc app=leetcode.cn id=16 lang=java
+ *
+ * [16] 最接近的三数之和
+ */
+
+// @lc code=start
+class Solution {
+    public int threeSumClosest(int[] nums, int target) {
+        Arrays.sort(nums);
+        int diff = Integer.MAX_VALUE;
+        int result = 0;
+        for(int i=0;i<nums.length-2;i++){
+            if(i!=0&&nums[i]==nums[i-1])continue;
+            int j=i+1;
+            int k=nums.length-1;
+            while(j<k){
+                int sum=nums[i]+nums[j]+nums[k];
+                if (Math.abs(sum-target)<diff){
+                    diff=Math.abs(sum-target);
+                    result=sum;
+                }
+                if(sum==target){
+                    return sum;
+                }else if(sum>target){
+                    k--;
+                }else{
+                    j++;
+                }
+            }
+        }
+        return result;
+    }
+}
+// @lc code=end
+

Java/15.三数之和.java

@@ -0,0 +1,43 @@
+/*
+ * @lc app=leetcode.cn id=17 lang=java
+ *
+ * [17] 电话号码的字母组合
+ */
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+// @lc code=start
+class Solution {
+    public List<String> letterCombinations(String digits) {
+        if(digits.equals("")||digits==null){
+            return new ArrayList<String>();
+        }
+        Map<Character,String> map=new HashMap<>();
+        map.put('2', "abc");
+        map.put('3', "def");
+        map.put('4', "ghi");
+        map.put('5', "jkl");
+        map.put('6', "mno");
+        map.put('7', "pqrs");
+        map.put('8', "tuv");
+        map.put('9', "wxyz");
+        List<String> result= new ArrayList<String>();
+        result.add("");
+        for(int i=0;i<digits.length();i++){
+            String letterSeq=map.get(digits.charAt(i));
+            int resultSize=result.size();
+            for(int j=0;j<resultSize;j++){
+                String topStr=result.remove(0);
+                for(int k=0;k<letterSeq.length();k++){
+                    result.add(topStr+letterSeq.charAt(k));
+                }
+            }
+
+        }
+        return result;
+    }
+}
+// @lc code=end
+

Java/16.最接近的三数之和.java

@@ -0,0 +1,38 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+/*
+ * @lc app=leetcode.cn id=18 lang=java
+ *
+ * [18] 四数之和
+ */
+
+// @lc code=start
+class Solution {
+    
+    List<List<Integer>> result = new ArrayList<>();
+    public List<List<Integer>> fourSum(int[] nums, int target) {
+        Arrays.sort(nums);
+        for (int i = 0; i < nums.length-3; i++) {
+            if (i != 0 && nums[i] == nums[i - 1]) continue;
+            int[] numsSub=Arrays.copyOfRange(nums, i+1, nums.length);
+            threeSum(numsSub, target-nums[i], nums[i]);
+        }
+        return result;
+    }
+    public void threeSum(int[] nums, int target, int numi) {
+        for (int i = 0; i < nums.length; i++) {
+            if (i != 0 && nums[i] == nums[i - 1]) continue;
+            int j = i + 1, k = nums.length - 1;
+            while (j < k) {
+                int sum = nums[i] + nums[j] + nums[k];
+                if (sum == target) result.add(Arrays.asList(numi, nums[i], nums[j], nums[k]));
+                if (sum <= target) do j++; while (j < k && nums[j] == nums[j - 1]);
+                if (sum >= target) do k--; while (j < k && nums[k] == nums[k + 1]);
+            }
+        }
+    }
+}
+// @lc code=end
+

Java/17.电话号码的字母组合.java

@@ -0,0 +1,46 @@
+/*
+ * @lc app=leetcode.cn id=19 lang=java
+ *
+ * [19] 删除链表的倒数第 N 个结点
+ */
+
+// @lc code=start
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public ListNode removeNthFromEnd(ListNode head, int n) {
+        ArrayList<ListNode> list= new ArrayList<ListNode>();
+        ListNode t=head;
+       
+        while(t!=null){
+            list.add(t);
+            t=t.next;
+        }
+        int listLen= list.size();
+        if(n==listLen){
+            if(listLen!=1){
+                return list.get(1);
+            }else{
+                return null;
+            } 
+        }else if(n==1){
+            t=list.get(listLen-n-1);
+            t.next=null;
+            return head;
+        }else{
+            t = list.get(listLen-n-1);
+            t.next=list.get(listLen-n).next;
+            return head;
+        }
+    }
+}
+// @lc code=end
+