编程题
文章平均质量分 51
景b
编程 斯诺克 篮球
展开
-
输出集合的子集---二进制法
之前以为子集会原创 2014-09-17 19:38:37 · 750 阅读 · 0 评论 -
Reverse Linked List
Reverse a singly linked list.题意:反转一个链表 比方 1→2→3→4 变成 4→3→2→1自己画的一个图,一图胜千言嗯public ListNode reverseList(ListNode head) { if (null == head) return head; ListNode pre = head; ListNode post原创 2015-05-16 23:05:24 · 291 阅读 · 0 评论 -
Triangle leetcode上这道题最详细的解答
原文链接:https://leetcode.com/discuss/5337/dp-solution-for-triangle 写的非常详细自己比较菜不会做但看到这么详细的解释和清晰的思路还是记录一下然后和大家分享下恩(⊙o⊙)…主要是讲了他为什么会用DP而不是DFS,然后分析了从上到下和从下到上两种解法的差别。下面是翻译: 这个问题在我看来结构(well-formed)非翻译 2015-05-14 13:52:52 · 521 阅读 · 0 评论 -
House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house原创 2015-05-13 20:22:44 · 283 阅读 · 0 评论 -
Roman to Integer
题目:Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.把罗马数字转成Int罗马数字的计数规则可以到百度百科了解下 点击打开链接 不会很难思路:把字符串每一位取出来跟后面一位比较,如果是比后面小则取反因为有这原创 2015-01-18 14:40:42 · 280 阅读 · 0 评论 -
Single Number 和 Single Number II
题目:Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using原创 2014-12-27 17:57:55 · 326 阅读 · 0 评论 -
Same Tree
题目:Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.判断两原创 2014-12-28 20:09:01 · 295 阅读 · 0 评论 -
Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321要求反转后的数溢出时返回0,比如1000000003 public int reverse(int x) { int sum = 0; while (x != 0) { if (s原创 2014-12-25 22:24:58 · 326 阅读 · 0 评论 -
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原创 2015-02-01 17:06:40 · 343 阅读 · 0 评论 -
Min Stack
leetCodeDesign a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.t原创 2014-12-24 14:41:08 · 316 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node
题目:Populate each next pointer to point to its next right原创 2015-01-12 00:31:24 · 309 阅读 · 0 评论 -
Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element原创 2014-12-23 20:06:37 · 330 阅读 · 0 评论 -
Binary Tree Preorder Traversal
题目:Given a binary tree, return the preorder traversal of its nodes' values.Note: Recursive solution is trivial, could you do it iteratively?非递归先序遍历一棵二叉树之前遇到都是写的递归式的,觉得迭代方式不好理解,然后在discuss里看原创 2015-01-07 22:20:08 · 295 阅读 · 0 评论 -
leetCode Word Search
Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically原创 2014-10-23 22:39:24 · 289 阅读 · 0 评论 -
Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Fin原创 2015-05-21 16:11:18 · 406 阅读 · 0 评论