Wuzihui___-CSDN博客

翻译 C++中内存分配有关的问题整理

与C++中内存分配有关的问题整理C程序内存模型图示组成文本段（text）：文本段主要存储的是编译链接完成后的机器指令初始化数据区：包含已经初始化的全局变量和静态变量，当然可以再细分为只读和可读写的初始化数据区，该区域的数据有：static int i = 10;int i = 10; // 全局变量（定义在任何函数体之外）未初始化数据区：也被称为bss（block sta...

2020-04-13 14:59:07 250

原创 Github issues的使用

什么是issuesGithub为开发者提供了许多便于开发的功能，其中，issues功能被用来追踪各种想法，增强功能，任务，bug等。许多的项目通过centeral bug tracker收集用户的反馈，Github通过issues来实现同样的功能。 Issues经常被误解为一个报告软件bug的地方，其实不然。报告软件bug只是Issues众多功能中的一个。项目维护者可以通过Issues来...

2018-04-15 19:21:38 42014 3

原创 Leetcode494. Target Sum

题目： You are given a list of non-negative integers, a1, a2, …, an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol. Find ou

2018-01-03 23:26:21 399

原创吝啬SAT问题是NP完全问题

思路要证明吝啬SAT问题是一个NP完全问题，可以通过尝试将一个已知的NP完全问题归约到吝啬SAT问题。从问题的形式上来看，可以通过尝试将SAT问题归约到吝啬SAT问题 SAT问题的定义如下： The Boolean satisfiability problem (SAT) is, given a formula, to check whether it is satisfiable.

2018-01-03 21:05:08 765

原创 Leetcode 322. Coin Change

题目描述 You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of

2017-12-25 15:02:01 439

原创 Leetcode Two Maximum Subarray Questions

Leetcode 53. Maximum Subarray题目： Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2,1,-5,4],

2017-12-18 15:55:01 374

原创 Leetcode62-63 Unique Paths

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 tr

2017-12-11 09:57:47 310

原创 Leetcode546. Remove Boxes(Hard)

题目 Given several boxes with different colors represented by different positive numbers. You may experience several rounds to remove boxes until there is no box left. Each time you can choose some

2017-12-04 21:49:08 1710

原创 leetcode120 Triangle

题目 Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [6,5

2017-11-27 09:54:41 312

原创 leetcode House Robber I II

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

2017-11-20 09:18:58 337

原创 leetcode Some questions of Edit Distance

leetcode72 Edit Distance题目 Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have the following 3 o

2017-11-13 09:08:48 365

原创 leetcode4. Median of Two Sorted Arrays

题面 There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1:nums1 = [

2017-11-09 12:27:22 303

原创动态规划 — LIS

动态规划介绍动态规划是比较重要的算法啦，打算慢慢写几篇博客总结一下。动态规划的基本思想是：要求原问题的解，先求出更小一些的问题的解，由子问题的解通过某种方式得到原问题的解。通常，我们也称每个子问题是一个状态，由子问题计算原问题，称为状态迁移由子问题计算原问题的方式称为状态转移方程一个动态规划算法的复杂度通常取决于状态的数量和状态迁移的复杂度以上是有关动态规划的一些基本概念和概括。LIS问

2017-10-29 12:08:21 783

原创 leetcode452. Minimum Number of Arrows to Burst Balloons

题面 There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it’s horizontal, y-coo

2017-10-29 09:09:48 316

原创 leetcode 2. 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 retu

2017-10-24 13:49:01 317

原创 leetcode 316. Remove Duplicate Letters(Hard)

题面 Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure your result is the smallest in lexicographical ord

2017-10-24 13:38:33 499

原创 leetcode 315. Count of Smaller Numbers After Self(Hard)

题面：You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].Example:Giv

2017-10-16 15:59:14 350

原创 leetcode675. Cut Off Trees for Golf Event（Hard）

题面You are asked to cut off trees in a forest for a golf event. The forest is represented as a non-negative 2D map, in this map:0 represents the obstacle can’t be reached. 1 represents the ground can b

2017-10-05 15:29:19 753

原创 329. Longest Increasing Path in a Matrix

问题描述：Given an integer matrix, find the length of the longest increasing path.From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move outside

2017-09-25 08:30:38 569

原创 Two question about Divide and Conquer

这星期算法课刚好讲到分治算法，便在leetcode上面找了两道关于分治算法的练习题来练练手。第一题:169. 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.

2017-09-17 11:26:28 460

原创 leetcode 445. Add Two Numbers II

leetcode 445. Add Two Numbers II题面：You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit

2017-09-10 12:30:50 344

Wuzihui___的博客