Leedcode
大号小白兔
One's life must be matter
展开
-
leetcode 66---Plus One 进位 数组
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.解题思路:整数加1,需要考虑的是进位和最后的结果会不会多一原创 2016-05-17 16:40:57 · 526 阅读 · 0 评论 -
leetcode 67---Add Binary 二进制 进位 String
Given two binary strings, return their sum (also a binary string).For example, a = “11” b = “1” Return “100”.解题思路有3个需要注意:进位、哪一个更长一些、如何返回。 1、至于进位就是使用charAt(i)-‘0’得到每一位的数值;然后使用除2和模2进行操作,进位可以通过循环传递。原创 2016-05-17 19:43:06 · 420 阅读 · 0 评论 -
leetcode 2---Add Two Numbers 进位 链表 数学
You are given two linked lists representing two non-negative numbers. 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 linke原创 2016-05-17 20:49:15 · 423 阅读 · 0 评论 -
leetcode 3---Longest Substring Without Repeating Characters 双指针 String
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 le原创 2016-06-29 10:33:50 · 563 阅读 · 0 评论 -
leetcode 350---Intersection of Two Arrays II 数组 双指针 排序
Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].Note: Each element in the result should appear as many times as it原创 2016-06-29 15:17:55 · 530 阅读 · 0 评论 -
leetcode--Happy Number
A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equa原创 2016-03-17 16:45:29 · 622 阅读 · 0 评论 -
leetcode---ZigZag Conversion 找规律
The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H N A P L S I I G原创 2016-06-20 10:18:55 · 528 阅读 · 0 评论 -
leetcode---Compare Version Numbers
Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and conta原创 2016-06-20 11:12:26 · 343 阅读 · 0 评论 -
leetcode---Valid Parentheses
Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.The brackets must close in the correct order, “()” and “()[]{}” are all valid but “原创 2016-06-21 10:32:23 · 410 阅读 · 0 评论 -
leetcode--Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. 找到多个字符串的最大公共子序列,方法是从第一个字符串开始,然后依次比较第一个字符串的每一个字符和其余字符串的每一个字符是否相等。package stringTest;public class LongestCommonPref原创 2016-06-22 10:33:48 · 345 阅读 · 0 评论 -
leetcode--Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.解题思路:罗马数字用几个特殊的符号表示特殊的数字,其余的数字用多个符号的左右次序表示。如果一个符号代表的数字比下一个小,则是相减。否则就是相加。public class Solution {原创 2016-06-20 19:20:48 · 445 阅读 · 0 评论 -
leetcode--Move Zeroes
Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling your funct原创 2016-03-18 16:45:07 · 522 阅读 · 0 评论 -
leetcode 83--Remove Duplicates from Sorted List 链表 删除元素
Given a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3. 解题思路就是遍历链表,如果2个节点的元素值相等就删掉后一个,原创 2016-05-09 20:05:04 · 372 阅读 · 0 评论 -
leetcode 82-- Remove Duplicates from Sorted List II 链表 双指针 删除元素
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example, Given 1->2->3->3->4->4->5, return 1->2->5. Given 1->1->1->2原创 2016-05-09 20:35:31 · 429 阅读 · 0 评论 -
leetcode 21--Merge Two Sorted Lists 链表 合并
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.有序链表合并,参考单链表的归并排序。其实这个是是链表归并排序的一部分。/** * Definition for sin原创 2016-05-09 16:57:53 · 386 阅读 · 0 评论 -
leetcode---64. Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at any原创 2016-09-04 15:00:28 · 898 阅读 · 0 评论 -
leetcode----63. Unique Paths II
Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the grid.For ex原创 2016-09-04 14:42:06 · 549 阅读 · 0 评论 -
leetcode---62. Unique Paths
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the botto原创 2016-09-04 14:35:57 · 636 阅读 · 0 评论 -
leetcode 151. Reverse Words in a String 字符串 翻转
Given an input string, reverse the string word by word.For example, Given s = “the sky is blue”, return “blue is sky the”.思路:按照空格分割后存到字符串数组里,然后从后向前遍历存储,需要注意前面的空格和后面的空格。 注意区分“”和“ ”的区别。package test;pu原创 2016-08-08 15:58:29 · 832 阅读 · 0 评论 -
leetcode 237 --Delete Node in a Linked List 链表 删除节点
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, t原创 2016-03-17 22:00:06 · 410 阅读 · 0 评论 -
leetcode 92. Reverse Linked List II 链表 部分反转
Reverse a linked list from position m to n. Do it in-place and in one-pass.For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note: Given m, n satisfy the following co原创 2016-08-03 11:29:11 · 599 阅读 · 0 评论 -
leetcode 206 ---Reverse Linked List 链表 反转
Reverse a singly linked list. 单链表的反转,核心是节点的下一个指向哪里的问题。 java版:public class test{public class ListNode{ int val; ListNode next' ListNode(int x){ val=x;}}public ListNode reverseList(Lis原创 2016-04-26 14:10:19 · 367 阅读 · 0 评论 -
leetcode 61 --Rotate List 链表 循环/断开 翻转
Given a list, rotate the list to the right by k places, where k is non-negative.For example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL.对于这题我们首先需要遍历链表,得到链表长度n,因为k可能大于n,所以我们需要取余处理原创 2016-05-06 13:53:01 · 503 阅读 · 0 评论 -
leetcode 328 --Odd Even Linked List 链表 双指针 移动节点
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do it in plac原创 2016-05-04 22:34:58 · 786 阅读 · 0 评论 -
leetcode 1---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.Example: Given nums = [2, 7, 11,原创 2016-04-29 16:48:08 · 372 阅读 · 0 评论 -
leetcode 88--Merge Sorted Array 数组 合并 双指针
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional原创 2016-05-06 11:28:26 · 881 阅读 · 0 评论 -
leetcode---Insertion Sort List
Sort a linked list using insertion sort. 链表的插入排序。和数组不同的是单链表是从前向后遍历的,所有使用从前向后插入元素的时候要找到第一个大于目标元素的位置,然后把目标元素节点插到其前面。/** * Definition for singly-linked list. * public class ListNode { * int val;原创 2016-05-09 19:40:22 · 379 阅读 · 0 评论 -
leetcode---SortList
Sort a linked list in O(n log n) time using constant space complexity.对单链表进行排序,时间复杂度和空间复杂度决定了使用堆排序或者是快速排序。 采用的是堆排序,和数组不同的地方是需要找到中间的节点,然后递归进行分割到最下的单位,最后进行合并,合并的时候采用的是哑节点进行帮助,这样会方便的进行操作。/** * Definitio原创 2016-05-09 16:49:36 · 408 阅读 · 0 评论 -
leetcode--Rotate Array
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note: Try to come up as many solutions as you can, ther原创 2016-05-06 13:17:55 · 385 阅读 · 0 评论 -
leedcode--Excel Sheet Column Number
Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.解题思路:进制的转换,26进制转10进制,注意点就是A-Z不是以0开头,所以要记得加1。java版:public class Solut原创 2016-03-22 13:40:33 · 720 阅读 · 0 评论 -
leetcode--Counting Bits
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.Example: For num = 5 you sh原创 2016-03-30 11:23:42 · 513 阅读 · 0 评论 -
Jsionarray和jsionobject-----java
1、获取jsionobject中的每一个元素:String res={"location":{"latitude":39.77,"longitude":117.32}} JSONObject tmpJson1 = new JSONObject(res); JSONObject position = null; position = tmpJson1.getJSONObject("locati原创 2016-03-07 13:45:10 · 616 阅读 · 0 评论 -
Valid Anagram ---leetcode
Given two strings s and t, write a function to determine if t is an anagram of s.For example, s = “anagram”, t = “nagaram”, return true. s = “rat”, t = “car”, return false.Note: You may assume the s原创 2016-03-17 14:27:51 · 466 阅读 · 0 评论 -
Ugly Number--leetcode
Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly since it in原创 2016-03-17 16:07:59 · 505 阅读 · 0 评论 -
leetcod--Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?解题思路:这是一个裴波那契数列。java版本:public class S原创 2016-03-20 17:03:46 · 415 阅读 · 0 评论 -
leetcode-- Invert Binary Tree
反转二叉树。 解题思路:左右节点互换,然后递归调用即可。java版本:public class Solution { public TreeNode invertTree(TreeNode root) { if(root==null) {return root;} TreeNode tmp=invertTree(root.left); root.原创 2016-03-18 17:23:22 · 476 阅读 · 0 评论 -
leetcode--singnal num
Given an array of integers, every element appears twice except for one. Find that single one.Note:our algorithm should have a linear runtime complexity. Could you implement it without using extra memor原创 2016-03-18 15:27:34 · 474 阅读 · 0 评论 -
leetcode--Find the Duplicate Number
Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, fin原创 2016-03-18 11:48:14 · 392 阅读 · 0 评论 -
leetcode---Power of Three
Given an integer, write a function to determine if it is a power of three.判断是不是3的幂次,首先看3是不是它的因子,如果是再依次除以三。#include <iostream>using namespace std;bool isPowerOfThree(int n){ if(n==0) return原创 2016-03-17 20:55:47 · 530 阅读 · 0 评论 -
leetcode--Reserve Vowels of a String
Write a function that takes a string as input and reverse only the vowels of a string.Example 1: Given s = “hello”, return “holle”.Example 2: Given s = “leetcode”, return “leotcede”.反转元音字母,只需要做判断就行了,原创 2016-04-26 12:44:47 · 738 阅读 · 0 评论