蚂蚱跳跃算法

int n ; while (cin >> n) { n = n > 0 ? n : 0 - n; int index = 1; int sum = 0; while (sum < n) { sum += index; index++; } if ((sum - n) % 2 == 0) { cout << index - 1 << endl; } else { if (index % 2 == 1) { cout << index << endl; } else { cout << index + 1 << endl; } } }

只能a 17%。。不知道哪里的问题。。

同17%，不知道怎么解决

都是17%，我还以为就我一个...

卧槽...我也是，我是直接放弃最后一道来攻这道的...死活想不出哪个楼了

完全没有想法，求大神贴一下代码啊

完全没思路，求大神贴代码

import java.util.Scanner; public class Main { /** * 蚂蚱跳跃次数 *  * @param desPoint * @return */ public static int jumpCount(int desPoint) { int currentJumpPosition = 0;// 当前跳跃的位置 int jumpStep = 0;// 跳跃步进 int jumpCount = 0;// 跳跃次数 while (currentJumpPosition != desPoint) {// 循环，往一个方向跳跃 if (desPoint > 0) jumpStep += 1; // 正方向 else { jumpStep += -1;// 反方向 } jumpCount++; currentJumpPosition += jumpStep;// 加上步长 // 超过了 if ((desPoint > 0 && currentJumpPosition > desPoint) || (currentJumpPosition < desPoint && desPoint < 0)) { jumpCount--;// 减一 currentJumpPosition -= jumpStep;// 减去步进 jumpStep -= 1;// 减一 boolean isForward = false;// 往后 if (desPoint < 0) { isForward = true;     // 往前 } while (currentJumpPosition != desPoint) {// 来回跳跃，直到达到终点 jumpCount++; if (isForward) {// 往前跳 if (jumpStep > 0) { jumpStep = jumpStep + 1; } else { jumpStep = -jumpStep + 1; } } else { // 往后跳 if (jumpStep > 0) { jumpStep = -jumpStep - 1; } else { jumpStep = jumpStep - 1; } } isForward = !isForward;// 取反 currentJumpPosition += jumpStep;// 加上步长 } } } return jumpCount; } public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while (scanner.hasNext()) { int desPoint = scanner.nextInt();// 目标位置 System.out.println(jumpCount(desPoint)); } } } AC 17%

同 17% 

import java.util.Scanner; public class Main {     public static void main(String[] args) {         Scanner sc = new Scanner(System.in) ;         while (sc.hasNextInt()){             int x = sc.nextInt() ;             int step = 0 ;             int cur = 0 ;             int bs = 1 ;             while (cur != x){                 step++ ;                 if(cur > x ){                     if(cur-bs>=x){                         cur = cur-bs ; //向左跳                     }                     else{                         cur = cur+bs ; //向右跳                     }                 }else{                     if(cur+bs <= x){                         cur = cur+bs ; //向右跳                     }                     else                         cur = cur-bs ; //向左跳                 }                 bs++ ;             }             System.out.println(step);         }     } } 我忘记过了多少了, 但是很少,不知道该怎么改了...

 import java.util.Scanner; public class Main{     public static void main(String[] args){         Scanner scan = new Scanner(System.in);         while(scan.hasNext()){             int x = scan.nextInt();             int temp = x;             if(x<0){                   temp = -x;             }             if(temp==0){                   System.out.println(0);                   continue;             }             int cnt =0;             int sum = 0;             while(sum<temp){                   cnt++;                   sum = sum+cnt;                                }             while((sum-temp)%2!=0){                 cnt++;                 sum = sum+cnt;             }             System.out.println(cnt);                       }     } } 

有没有人跟我一样用动态规划子问题的规模越来越大，然后傻眼了的(´･ᆺ･`)

function main(n){       var sum=0;       var i=0;       while(sum<n){          i++;             sum+=i;                    }       if(sum>n){       var t=sum-n;       var sum1=0;       var a=0;       while(sum1<t){       a++;       sum1+=a;       }       }else{       a=0;       }              return i+a; } 用js写的，写的好简单。。。通过率17%

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()){ int n = sc.nextInt(); if(n==0 || Math.abs(n)==1){ System.out.println(n); return; } int location1 = -1, location2 = 1; int step = 2; n = Math.abs(n); System.out.println(Math.min(get(n,location1,step),get(n,location2,step))); } } static int get(int x, int location , int step){ while (location<x){ if(location+step>x){ location -= step; step++; }else if(location+step<x){ location += step; step++; }else { break; } } return step; } }