摘要: class Solution { public int[] twoSum(int[] nums, int target) { //我们要找到2个数之和等于target //即我们需要找到nums[i] + nums[j] == target,并且返回他们的下标(i和j),其中i != j int[] 阅读全文
posted @ 2024-03-22 08:03 淼and 阅读(69) 评论(0) 推荐(0)
摘要: Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(){} ListNode(int val) {this.val = val;} ListNode(int val, 阅读全文
posted @ 2024-03-21 21:13 淼and 阅读(104) 评论(0) 推荐(0)