wangyang20170901的博客

1、问题： Say you have an array for which theithelement is the price of a given stock on dayi. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, ...

1.问题 Say you have an array for which theithelement is the price of a given stock on dayi. If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the st...

1、题目 给定一个整数数组，每个元素都出现了两次，但有一个只出现了一次，请找出这个数。 Note：算法要求有线性时间复杂度，并且不占用额外的空间。 2、解法： public class Solution { public int singleNumber(int[] A) { int re=0; int i; for(i= 0;i&...

1、题目： Reverse digits of an integer. Example1:x = 123, return 321Example2:x = -123, return -321 Have you thought about this? Here are some good questions to ask before coding. Bonus points for yo...

1、问题 Determine whether an integer is a palindrome. Do this without extra space. click to show spoilers. Some hints: Could negative integers be palindromes? (ie, -1) If you are thinking of convert...