摘要:
链接:https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/ 代码 /** * Definition for singly-linked list. * public class ListNode { * int val; 阅读全文
摘要:
链接:https://leetcode-cn.com/problems/4sum/ 代码 class Solution { public List<List<Integer>> fourSum(int[] nums, int target) { List<List<Integer>> ans = n 阅读全文
摘要:
链接:https://leetcode-cn.com/problems/3sum-closest/ 代码 class Solution { public int threeSumClosest(int[] nums, int target) { int ans = nums[0] + nums[1] 阅读全文
摘要:
链接:https://leetcode-cn.com/problems/roman-to-integer/ 代码 class Solution { public int romanToInt(String s) { int ans = 0; HashMap<Character, Integer> m 阅读全文