摘要:
public class Solution { public int lengthOfLongestSubstring(String s) { int n = s.length(); int ans = 0; for (int i = 0; i < n; i++) for (int j = i + 阅读全文
posted @ 2019-12-19 15:22
燕十三丶
阅读(919)
评论(0)
推荐(0)
摘要:
public ListNode addTwoNumbers(ListNode l1, ListNode l2) { ListNode dummyHead = new ListNode(0); ListNode p = l1, q = l2, curr = dummyHead; int carry = 阅读全文
posted @ 2019-12-19 11:31
燕十三丶
阅读(1007)
评论(0)
推荐(0)
摘要:
class Solution { public int[] twoSum(int[] nums, int target) { for (int i = 0; i < nums.length;i++){ for(int j = i + 1;j < nums.length;j++){ if (nums[ 阅读全文
posted @ 2019-12-19 09:58
燕十三丶
阅读(4227)
评论(0)
推荐(0)

浙公网安备 33010602011771号