LeetCode前3题
来源:互联网 发布:奶牛场优化养殖 编辑:程序博客网 时间:2024/06/11 11:01
Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
public static int[] twoSum(int[] numbers, int target) { int[] result = new int[2]; Map<Integer, Integer> map = new HashMap<Integer, Integer>(); for (int i = 0; i < numbers.length; i++) { if (map.containsKey(target - numbers[i])) { result[1] = i; result[0] = map.get(target - numbers[i]); return result; } map.put(numbers[i], i); } return result; }
Add Two Numbers
You are given two non-empty linked lists representing two non-negative
integers. The digits are stored in reverse order and each of their
nodes contain a single digit. Add the two numbers and return it as a
linked list.You may assume the two numbers do not contain any leading zero, except
the number 0 itself.Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8
class ListNode { int val; ListNode next; ListNode(int x) { val = x; }}public ListNode addTwoNumbers(ListNode l1, ListNode l2) { ListNode l3 = new ListNode(0); ListNode m = l1; ListNode n = l2; ListNode result = l3; int sum = 0; int carry = 0; while(m != null || n != null){ if (m != null){ sum += m.val; m = m.next; } if(n != null){ sum += n.val; n = n.next; } carry = sum / 10; if(carry == 1) result.next = new ListNode(sum % 10); else result.next = new ListNode(sum); sum = carry; result = result.next; } if(sum == 1) result.next = new ListNode(sum); return l3.next;}
Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without
repeating characters.Examples:
Given “abcabcbb”, the answer is “abc”, which the length is 3.
Given “bbbbb”, the answer is “b”, with the length of 1.
Given “pwwkew”, the answer is “wke”, with the length of 3. Note that
the answer must be a substring, “pwke” is a subsequence and not a
substring.
public int lengthOfLongestSubstring(String s) { int length = 0; int curr = 0; int start = 0; int index= 0; HashMap<Integer,Integer> map = new HashMap<>(); char[] s2ch = s.toCharArray(); int size = s2ch.length; int value = 0; for(int i = 0;i < size;i++){ value = s2ch[i]; if(!map.containsKey(value)){ curr++; map.put(value,i); }else{ if(curr > length){ length = curr; } start = map.get(value); while(index<= start){ map.remove((int) s2ch[index]); index++; } map.put(value,i); curr = i - start; } } return (curr > length) ? curr : length;}
- LeetCode前3题
- 【LeetCode】Binary Tree Preorder Traversal 二叉树的前序遍历(3种方法)- Easy+
- LeetCode Jump Game 前跳游戏
- leetcode 105【前序,中序建树】
- LeetCode钻研8 前序遍历树
- LeetCode基础--二叉树--前序遍历
- leetcode笔试题二叉树的前序、中序、后序遍历的递归和循环c++实现
- 前5题
- TCP前3数据包
- java显示1秒前,1分钟前,2分钟前,3天前
- leetcode combination 前两天才看的,又忘记了
- LeetCode Jump Game II 前跳游戏II
- leetcode刷题7:前序遍历二叉树
- LeetCode之二叉树的前序遍历
- 算法概论第二周作业(前3题)
- Codeforces Round #238 (Div. 2)前3题解题报告
- Codeforces Round #240 (Div. 1) 前3题 解题报告
- Codeforces Round #260 (Div. 1) | 前3题
- toggle操作
- Generics的方法参数,Set 两集合进行并、交、差
- 【机器学习】softmax函数总结
- 数组元素的访问方式—指针与下标
- JDK源码【集合框架】list
- LeetCode前3题
- 如何解决idea中XML配置文件里面的URI is not registered问题
- JqGrid 修改为application/json模式
- 使用 Linux 的 strace 命令跟踪/调试程序的常用选项
- |算法讨论|后缀数组 学习笔记
- linux centos基本命令
- 在Fragment中修改Activity中的控件
- 较好的程序设计竞赛有哪些
- 数据结构实验之栈七:出栈序列判定