leetcode
kyolxs
这个作者很懒,什么都没留下…
展开
-
day01:两数之和(Java)
class Solution { public int[] twoSum(int[] nums, int target) { Map<Integer, Integer> map = new HashMap<>(); for (int i = 0; i <= nums.length-1; i++) { i...原创 2019-01-26 20:25:10 · 1592 阅读 · 0 评论 -
day07:最接近的三数之和(Java)
第7天了,依旧是很快写出充满BUG的代码,然后调试几小时,唉,好惨。 class Solution { public int threeSumClosest(int[] nums, int target) { // 边界判断 if (nums == null || nums.length < 3) return 0; ...原创 2019-02-01 15:04:22 · 192 阅读 · 0 评论 -
day02:寻找两个有序数组的中位数(Java)
class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { int[] allArray = new int[nums1.length + nums2.length]; for (int i = 0; i <= nums1.length - 1; i++)...原创 2019-01-28 15:34:59 · 404 阅读 · 0 评论 -
day03:最长回文子串(Java)
class Solution { public String longestPalindrome(String s) { // 边界判断 if (s == null || s.length() == 0) return s; int len = s.length(); int l =...原创 2019-01-29 17:11:18 · 330 阅读 · 0 评论 -
day04:字符串转整数(atoi)
class Solution { public static boolean flag; public int myAtoi(String str) { str = str.trim(); if (str == null || str.length() < 1) { flag = false; retu...原创 2019-01-29 18:51:43 · 120 阅读 · 0 评论 -
day06:三数之和(Java)
class Solution { public List<List<Integer>> threeSum(int[] nums) { List<List<Integer>> result = new ArrayList<>(); if (nums == null || nums.length &l...原创 2019-01-30 21:30:28 · 157 阅读 · 0 评论 -
Reverse Integer
class Solution { public int reverse(int x) { // 标记符,1为正,-1为负 int flag = 1; if (x < 0) { x = -x; flag = -1; } Stack<Character...原创 2019-02-11 18:25:09 · 234 阅读 · 0 评论