今日天晴

题目：给定一个整数数组和一个目标值，找出数组中和为目标值的两个数。你可以假设每个输入只对应一种答案，且同样的元素不能被重复利用。 public static int[] twoSum(int[] nums, int target) { int []a=new int[2]; for(int i = 0; i < nums.length - 1; i++) { for...

给定两个非空链表来表示两个非负整数。位数按照逆序方式存储，它们的每个节点只存储单个数字。将两数相加返回一个新的链表。你可以假设除了数字 0 之外，这两个数字都不会以零开头。public class ListNode { ListNode next; int val; public ListNode(int x) { val = x; } } public ListNode add...

public class ReverseList { public static ListNode reverseList(ListNode head) { if (head == null || head.next == null) { return head; } ListNode pre = null; pre.next = null; ...

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array. ...