leetcde
whynotwsdn
这个作者很懒,什么都没留下…
展开
-
leetcode - 1.Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target原创 2017-05-19 16:21:04 · 223 阅读 · 0 评论 -
leetcode - 72. Edit Distance和 583. Delete Operation for Two Strings
72. Edit DistanceGiven 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 operations permitte原创 2017-05-24 12:24:17 · 292 阅读 · 0 评论 -
leetcode - 2.addTwoNumbers
/** * 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 t原创 2017-05-22 17:39:56 · 189 阅读 · 0 评论 -
动态规划入门
动态规划基本原理转载 2017-06-14 11:34:18 · 232 阅读 · 0 评论 -
volatile不能保证原子性
volatile原创 2017-06-26 16:50:47 · 1195 阅读 · 0 评论 -
3. Longest Substring Without Repeating Characters最长不重复子串
最长不重复子串原创 2017-08-18 11:48:16 · 234 阅读 · 0 评论 -
01背包
01背包原创 2017-08-16 21:53:50 · 308 阅读 · 0 评论 -
需要找两个有序数组的第K个数
需要找两个有序数组的第K个数public class Main { public static void main(String[] args){ int nums1[]={1,2,3,4,5,6}; int nums2[]={7,8,9,10,11,12}; Main main=new Main(); System...原创 2017-10-16 11:20:57 · 309 阅读 · 0 评论