剑指Offer 41题和为s的两个数字VS 何为S的连续正数序列 Java版

最新推荐文章于 2024-10-01 23:05:47 发布

yuhushangwei

最新推荐文章于 2024-10-01 23:05:47 发布

阅读量745

点赞数

分类专栏：学习笔记文章标签：算法剑指Offer JAVA

本文链接：https://blog.csdn.net/yuhushangwei/article/details/52730902

版权

学习笔记专栏收录该内容

154 篇文章 0 订阅

订阅专栏

package test;

public class FindNumbersWithSum {
	
	public boolean findNumbersWithSum(int[] data, int length, int sum, int num1, int num2){
		
		boolean found = false;
		if(length <1 ){
			return true;
		}
		int ahead = length -1;
		int behind = 0;
		while(ahead > behind){
			long tempSum = data[ahead] + data[behind];
			
			if(tempSum == sum){
				num1 = data[behind];
				num2 = data[ahead];
				System.out.println(num1 +" : "+num2);
				found = true;
				break;
			}else if(tempSum > sum){
				ahead--;
			}else if(tempSum < sum){
				behind++;
			}
		}
		
		return found;
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] data = {1,2,4,7,11,15};
		int num1 = 0, num2 =0;
		FindNumbersWithSum findNumbersWithSum = new FindNumbersWithSum();
		boolean result = findNumbersWithSum.findNumbersWithSum(data, data.length, 15, num1, num2);
		System.out.println(result);
	}

<pre name="code" class="java">package test;

public class FindContinuousSequence {
	
	public void findContinuousSequence(int sum){
		if(sum<3){
			return;
		}
		int small = 1;
		int big = 2;
		int middle = (1+sum)/2;
		int curSum = small+big;
		while(small < middle){
			if(curSum == sum){
				printContinuousSequence(small, big);
			}
			
			while(curSum> sum && small <middle){
				curSum -=small;
				small ++;
				if(curSum == sum){
					printContinuousSequence(small, big);
				}
			}
			big++;
			curSum += big;
		}
	}
	
	public void printContinuousSequence(int small, int big){
		for(int i= small; i<=big; ++i){
			System.out.print(i+" ");
		}
		System.out.println();
	}
	

	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}

}