Leetcode
文章平均质量分 64
我是一只小兔纸咿呀咿呀呦
To be a better me
展开
-
Sort Colors
public class Solution { public void sortColors(int[] A) { int left0 = 0,right0 = -1; int left1 = 0,right1 = 0; int left2 = 0,right2 = 0; int n = A[0];原创 2014-09-18 16:35:53 · 635 阅读 · 0 评论 -
Merge Sorted Array
从后往前插入,就不用移动数据了!public class Solution { public void merge(int A[], int m, int B[], int n) { int l = m + n - 1; m--; n--; while(0 <= m && 0 <= n){ if(A原创 2014-09-20 09:39:14 · 377 阅读 · 0 评论 -
Gray Code
下表为几种自然二进制码与格雷码的对照表:十进制数自然二进制数格雷码00000000010001000120010001130011001040100011050101011原创 2014-09-20 10:00:55 · 429 阅读 · 0 评论 -
Maximum Depth of Binary Tree
Maximum Depth of Binary Tree Total Accepted: 28870 Total Submissions: 65766My SubmissionsGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the原创 2014-09-10 20:03:22 · 323 阅读 · 0 评论 -
Best Time to Buy and Sell Stock II
我就是一只勤劳的小蜜蜂啊原创 2014-09-11 08:13:11 · 332 阅读 · 0 评论 -
SingleNumber
1.任意一个变量X与其自身进行异或运算,结果为0,即X^X=02.任意一个变量X与0进行异或运算,结果不变,即X^0=X3.异或运算具有可结合性,即a^b^c=(a^b)^c=a^(b^c)4.异或运算具有可交换性,即a^b=b^a转载 2014-09-10 15:09:41 · 368 阅读 · 0 评论 -
Same Tree
so easy~~~怪不得看到后面那位同学tian原创 2014-09-10 20:13:07 · 325 阅读 · 0 评论 -
Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are some good questions to ask before c原创 2014-09-10 20:44:23 · 385 阅读 · 0 评论 -
Binary Tree Preorder Traversal
竟然超时了T_Tpackage code;import java.util.ArrayList;import java.util.LinkedList;import java.util.List;import java.util.Queue;import java.util.Stack;/** * Definition for binary tree * public cl原创 2014-09-11 16:45:25 · 308 阅读 · 0 评论 -
Unique Binary Search Trees
public class Solution { public int numTrees(int n) { if (n == 1) return 1; if (n == 2) return 2; int[] record = new int[n + 1]; r原创 2014-09-11 09:27:01 · 279 阅读 · 0 评论 -
Linked List Cycle
越来越发现刷leetcode原创 2014-09-11 14:23:47 · 354 阅读 · 0 评论 -
Binary Tree Inorder Traversal
中序遍历:/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution {原创 2014-09-11 17:12:02 · 377 阅读 · 0 评论 -
Search Insert Position
https://oj.leetcode.com/problems/search-insert-position/public class Solution { public int searchInsert(int[] A, int target) { for(int i = 0; i < A.length; i++){ if(A[i] >= tar原创 2014-09-13 20:55:25 · 489 阅读 · 0 评论 -
Remove Duplicates from Sorted List
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public原创 2014-09-13 20:50:29 · 489 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node
/** * Definition for binary tree with next pointer. * public class TreeLinkNode { * int val; * TreeLinkNode left, right, next; * TreeLinkNode(int x) { val = x; } * } */ publ原创 2014-09-12 22:09:49 · 500 阅读 · 0 评论 -
Roman to Integer
给你一个罗马数字,翻译成整数;规则:原创 2014-09-14 21:07:03 · 447 阅读 · 0 评论 -
Climbing Stairs
public class Solution { public int C(int m1,int m2){ int sum1 = 1; for(int i = 0;i < m2;i++){ sum1 *= (m1 - i); } for(int i = 1;i <= m2; i++){原创 2014-09-14 20:11:44 · 397 阅读 · 0 评论 -
Int to Roman
public class Solution { public String intToRoman(int num) { StringBuilder stringBuilder = new StringBuilder(""); int c = num/1000; num %= 1000; for(int i = 0; i < c; i++){ stri原创 2014-09-15 11:10:57 · 398 阅读 · 0 评论 -
Single Number II
public class Solution { public int singleNumber(int[] A) { int[] b = new int[32]; int num = 0; for(int j = 0; j < 32; j++){ for(int i = 0; i < A.length原创 2014-09-15 09:56:37 · 420 阅读 · 0 评论 -
Convert Sorted Array to Binary Search Tree
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi原创 2014-09-15 15:40:24 · 372 阅读 · 0 评论 -
Balanced Binary Tree
要记得剪枝,不然会超时转载 2014-09-15 12:48:03 · 357 阅读 · 0 评论 -
Merge Two Sorted Lists
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public原创 2014-09-15 11:56:37 · 344 阅读 · 0 评论 -
Maximum Subarray
public class Solution { public int maxSubArray(int[] A) { int sum = A[0], max = A[0]; for (int i = 1; i < A.length; i++) { sum = sum < 0 ? A[i] : sum + A[i];原创 2014-09-15 10:27:31 · 371 阅读 · 0 评论 -
Remove Element
public class Solution { public int removeElement(int[] A, int elem) { int index = 0; for(int i = 0; i < A.length; i++){ if(elem != A[i]){ A[index++] = A原创 2014-09-15 12:13:46 · 337 阅读 · 0 评论 -
N-Queens II
class Solution {//always pay attention to do not change the parameters in current level by forwardingpublic: void solveNQueensUtil(int n, int curRow, int upc, int ld, int rd, int& totalCnt)转载 2014-09-16 15:12:36 · 471 阅读 · 0 评论 -
Swap Nodes in Pairs
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public原创 2014-09-17 17:06:30 · 617 阅读 · 0 评论 -
Symmetric Tree
理论上,下面的代码是没错的,不懂它那个测试用例{}原创 2014-09-17 18:20:12 · 542 阅读 · 0 评论 -
pat1003
package AdvancedLevelPractice;import java.util.Scanner;public class pat1003 { public static final int max = 0Xffff; public static void main(String[] args) { // TODO Auto-generated method stu原创 2015-01-17 17:21:43 · 413 阅读 · 0 评论 -
pat1004
package AdvancedLevelPractice;import java.util.Scanner;public class pat1004 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner scanner = new Scanner(Syst原创 2015-01-18 20:38:08 · 390 阅读 · 0 评论 -
pat1005
package AdvancedLevelPractice;import java.util.Scanner;public class pat1005 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner scanner = new Scanner(Syste原创 2015-01-18 20:38:23 · 559 阅读 · 0 评论 -
pat1008
package AdvancedLevelPractice;import java.util.Scanner;public class pat1008 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner scanner = new Scanner(Syste原创 2015-01-19 16:21:21 · 437 阅读 · 0 评论 -
pat1002
package AdvancedLevelPractice;import java.util.Scanner;public class pat1002 { public static void main(String[] args) { // TODO Auto-generated method stub int max = 1001; double[] coeffici原创 2015-01-18 20:43:18 · 389 阅读 · 0 评论 -
pat1006
package AdvancedLevelPractice;import java.util.Scanner;public class pat1006 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner scanner = new Scanner(Syste原创 2015-01-18 20:39:19 · 463 阅读 · 0 评论 -
pat1009
package AdvancedLevelPractice;import java.util.Iterator;import java.util.Map;import java.util.Scanner;import java.util.TreeMap;public class pat1009{ public static void main(String[] args) {原创 2015-01-19 20:11:04 · 452 阅读 · 0 评论 -
pat1010
package AdvancedLevelPractice;import java.util.Scanner;public class pat01010 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner scanner = new Scanner(Syste原创 2015-01-22 12:08:48 · 394 阅读 · 0 评论 -
pat1011
题意:水!!!分析:本来是水题一道,以为半个小时就能解决,可是,万万没想到啊,最后搞得泪流满面啊!!!double a = 7.5;double b = 4.1;duoble p = a*b;p得等于30.75吧可是,竟然等于30.7499999999999!!!欲哭无泪啊!!!破double!!!package AdvancedLevelPractic原创 2015-01-22 21:39:37 · 448 阅读 · 0 评论 -
pat1023
package AdvancedLevelPractice;import java.math.BigDecimal;import java.util.Scanner;public class pat1023 { public static void main(String[] args) { // TODO Auto-generated method stub Scanne原创 2015-01-25 11:12:35 · 508 阅读 · 0 评论 -
pat1041
#includeusing namespace std;int main(){ int N, i; int MAX = 10010; cin>>N; int count[MAX]; int a[N]; for( i = 0 ; i < N; i++){ cin>>a[i]; count[a[i]]++; } for(i = 0; i < N; i++){ if(原创 2015-03-02 15:08:00 · 479 阅读 · 0 评论 -
pat1013
真真地见识到不同算法的性能了,牛x!!!本来用java dfs,内存超限!!用java union-find,还是内存超限!!!用C++普通的union-find,超时!!!用quick-union,还是超时!!!用加权的quick-union才完全通过!!!而且前几个测试用例用70+ms直接降到了1ms#include#includeusing namespace std;#原创 2015-03-02 20:35:55 · 564 阅读 · 0 评论 -
pat1012
c++还真的比java要效率,一下午两道题java都超时,c++竟然AC了#include#includeusing namespace std;int main(){ int NN, MM, i, j; cin>>NN>>MM; string idStrings[NN],idString; int C[NN], M[NN], E[NN], A[NN], rank[4原创 2015-03-02 15:06:46 · 672 阅读 · 0 评论