leetcode
浅行learning
一个有梦想的代码狗。
展开
-
Leetcode刷题—1:有序数组的 Two Sum
使用双指针class Solution {public int[] twoSum(int[] numbers, int target) {int i=0;int j=numbers.length-1;while (j>i)if (numbers[i]+numbers[j]<target){i++;}else if (numbers[i]+numbers[j]>t...原创 2019-05-27 11:20:18 · 172 阅读 · 0 评论 -
Leetcode两数平方和
class Solution { public boolean judgeSquareSum(int c) { int i = 0, j = (int) Math.sqrt(c); while (i <= j) { if (i * i + j * j == c) { return true; ...原创 2019-05-27 11:32:35 · 349 阅读 · 0 评论 -
链表:1
public class Solution { public ListNode getIntersectionNode(ListNode headA, ListNode headB) {// headA和headB是否符合条件 if (headA == null || headB == null) { return null; ...原创 2019-06-09 14:21:20 · 108 阅读 · 0 评论 -
链表:2
/**Definition for singly-linked list.public class ListNode {int val;ListNode next;ListNode(int x) { val = x; }}*/class Solution {// 使用递归的方法public ListNode reverseList(ListNode h...原创 2019-06-09 14:47:35 · 63 阅读 · 0 评论 -
链表:3
class Solution {public ListNode mergeTwoLists(ListNode l1, ListNode l2) {if (l1 == null) {return l2;}if (l2 == null) {return l1;}if (l1.val < l2.val) {l1.next = mergeTwoLists(l1.next, l2);...原创 2019-06-10 10:59:06 · 188 阅读 · 0 评论